/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/popl20-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:03:31,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:03:31,102 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 01:03:31,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:03:31,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:03:31,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:03:31,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:03:31,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:03:31,127 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:03:31,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:03:31,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:03:31,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:03:31,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:03:31,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:03:31,129 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:03:31,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:03:31,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:03:31,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:03:31,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:03:31,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:03:31,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:03:31,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:03:31,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:03:31,129 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 01:03:31,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:03:31,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:03:31,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:03:31,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:03:31,407 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:03:31,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-15 01:03:32,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3311b362/d721047586e543a0b5b146942f745919/FLAG5a26b8041 [2025-03-15 01:03:32,758 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:03:32,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-15 01:03:32,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3311b362/d721047586e543a0b5b146942f745919/FLAG5a26b8041 [2025-03-15 01:03:32,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3311b362/d721047586e543a0b5b146942f745919 [2025-03-15 01:03:32,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:03:32,777 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:03:32,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:03:32,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:03:32,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:03:32,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:32,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edfc9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32, skipping insertion in model container [2025-03-15 01:03:32,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:32,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:03:32,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:03:32,915 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:03:32,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:03:32,956 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:03:32,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32 WrapperNode [2025-03-15 01:03:32,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:03:32,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:03:32,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:03:32,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:03:32,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:32,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,005 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 322 [2025-03-15 01:03:33,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:03:33,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:03:33,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:03:33,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:03:33,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:03:33,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:03:33,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:03:33,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:03:33,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (1/1) ... [2025-03-15 01:03:33,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:03:33,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:03:33,073 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 01:03:33,076 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 01:03:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:03:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:03:33,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:03:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:03:33,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:03:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:03:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:03:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:03:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:03:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:03:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:03:33,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:03:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:03:33,099 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 01:03:33,192 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:03:33,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:03:33,599 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:03:33,599 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:03:33,866 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:03:33,866 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 01:03:33,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:03:33 BoogieIcfgContainer [2025-03-15 01:03:33,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:03:33,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:03:33,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:03:33,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:03:33,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:03:32" (1/3) ... [2025-03-15 01:03:33,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200ba0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:03:33, skipping insertion in model container [2025-03-15 01:03:33,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:32" (2/3) ... [2025-03-15 01:03:33,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200ba0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:03:33, skipping insertion in model container [2025-03-15 01:03:33,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:03:33" (3/3) ... [2025-03-15 01:03:33,876 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-03-15 01:03:33,890 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:03:33,891 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 271 locations, 1 initial locations, 3 loop locations, and 53 error locations. [2025-03-15 01:03:33,891 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:03:33,981 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:03:34,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:03:34,034 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;@5e4e1821, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:03:34,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-03-15 01:03:34,062 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:03:34,062 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-15 01:03:34,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:03:34,064 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:34,065 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] [2025-03-15 01:03:34,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:34,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:34,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1444862944, now seen corresponding path program 1 times [2025-03-15 01:03:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402020550] [2025-03-15 01:03:34,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:34,242 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:03:34,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:34,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402020550] [2025-03-15 01:03:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402020550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:34,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:34,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:34,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918844792] [2025-03-15 01:03:34,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:34,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:34,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:34,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:34,274 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 280 [2025-03-15 01:03:34,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 280 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:03:34,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:34,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 280 [2025-03-15 01:03:34,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:34,490 INFO L124 PetriNetUnfolderBase]: 67/588 cut-off events. [2025-03-15 01:03:34,491 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-15 01:03:34,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 588 events. 67/588 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2417 event pairs, 44 based on Foata normal form. 14/489 useless extension candidates. Maximal degree in co-relation 537. Up to 123 conditions per place. [2025-03-15 01:03:34,501 INFO L140 encePairwiseOnDemand]: 244/280 looper letters, 19 selfloop transitions, 2 changer transitions 15/238 dead transitions. [2025-03-15 01:03:34,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 238 transitions, 530 flow [2025-03-15 01:03:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2025-03-15 01:03:34,511 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8654761904761905 [2025-03-15 01:03:34,513 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -34 predicate places. [2025-03-15 01:03:34,513 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 238 transitions, 530 flow [2025-03-15 01:03:34,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:03:34,514 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:34,514 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] [2025-03-15 01:03:34,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:03:34,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:34,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1873714791, now seen corresponding path program 1 times [2025-03-15 01:03:34,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:34,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800600887] [2025-03-15 01:03:34,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:34,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:34,562 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:03:34,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:34,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800600887] [2025-03-15 01:03:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800600887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:34,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:34,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746633695] [2025-03-15 01:03:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:34,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:34,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:34,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:34,565 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 280 [2025-03-15 01:03:34,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 238 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:03:34,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:34,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 280 [2025-03-15 01:03:34,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:34,680 INFO L124 PetriNetUnfolderBase]: 74/528 cut-off events. [2025-03-15 01:03:34,680 INFO L125 PetriNetUnfolderBase]: For 114/150 co-relation queries the response was YES. [2025-03-15 01:03:34,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 528 events. 74/528 cut-off events. For 114/150 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2094 event pairs, 50 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 560. Up to 132 conditions per place. [2025-03-15 01:03:34,683 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 18 selfloop transitions, 2 changer transitions 15/237 dead transitions. [2025-03-15 01:03:34,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 237 transitions, 570 flow [2025-03-15 01:03:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-03-15 01:03:34,688 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8261904761904761 [2025-03-15 01:03:34,688 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -33 predicate places. [2025-03-15 01:03:34,689 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 237 transitions, 570 flow [2025-03-15 01:03:34,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:03:34,689 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:34,689 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] [2025-03-15 01:03:34,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:03:34,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:34,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:34,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1885660952, now seen corresponding path program 1 times [2025-03-15 01:03:34,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:34,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594611745] [2025-03-15 01:03:34,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:34,728 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:03:34,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:34,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594611745] [2025-03-15 01:03:34,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594611745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:34,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:34,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:34,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313015853] [2025-03-15 01:03:34,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:34,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:34,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:34,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:34,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:34,731 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-15 01:03:34,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 237 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:03:34,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:34,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-15 01:03:34,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:34,822 INFO L124 PetriNetUnfolderBase]: 74/527 cut-off events. [2025-03-15 01:03:34,822 INFO L125 PetriNetUnfolderBase]: For 299/347 co-relation queries the response was YES. [2025-03-15 01:03:34,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 527 events. 74/527 cut-off events. For 299/347 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2084 event pairs, 50 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 613. Up to 132 conditions per place. [2025-03-15 01:03:34,826 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 13 selfloop transitions, 2 changer transitions 15/236 dead transitions. [2025-03-15 01:03:34,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 236 transitions, 598 flow [2025-03-15 01:03:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-15 01:03:34,831 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8404761904761905 [2025-03-15 01:03:34,831 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -32 predicate places. [2025-03-15 01:03:34,832 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 236 transitions, 598 flow [2025-03-15 01:03:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:03:34,832 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:34,832 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] [2025-03-15 01:03:34,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:03:34,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash 931819174, now seen corresponding path program 1 times [2025-03-15 01:03:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:34,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649955838] [2025-03-15 01:03:34,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:34,882 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:03:34,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:34,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649955838] [2025-03-15 01:03:34,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649955838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:34,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:34,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:34,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847728418] [2025-03-15 01:03:34,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:34,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:34,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:34,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:34,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:34,887 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-15 01:03:34,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 236 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:03:34,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:34,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-15 01:03:34,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:35,003 INFO L124 PetriNetUnfolderBase]: 74/526 cut-off events. [2025-03-15 01:03:35,004 INFO L125 PetriNetUnfolderBase]: For 532/586 co-relation queries the response was YES. [2025-03-15 01:03:35,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 526 events. 74/526 cut-off events. For 532/586 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2087 event pairs, 50 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 666. Up to 132 conditions per place. [2025-03-15 01:03:35,012 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 13 selfloop transitions, 2 changer transitions 15/235 dead transitions. [2025-03-15 01:03:35,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 235 transitions, 626 flow [2025-03-15 01:03:35,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-15 01:03:35,015 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8404761904761905 [2025-03-15 01:03:35,015 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -31 predicate places. [2025-03-15 01:03:35,015 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 235 transitions, 626 flow [2025-03-15 01:03:35,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:03:35,016 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:35,016 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] [2025-03-15 01:03:35,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:03:35,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:35,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2070897491, now seen corresponding path program 1 times [2025-03-15 01:03:35,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:35,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472151759] [2025-03-15 01:03:35,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:35,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:35,070 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:03:35,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:35,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472151759] [2025-03-15 01:03:35,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472151759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:35,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:35,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:35,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051483725] [2025-03-15 01:03:35,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:35,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:35,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:35,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:35,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:35,073 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 280 [2025-03-15 01:03:35,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 235 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:03:35,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:35,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 280 [2025-03-15 01:03:35,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:35,176 INFO L124 PetriNetUnfolderBase]: 77/573 cut-off events. [2025-03-15 01:03:35,177 INFO L125 PetriNetUnfolderBase]: For 834/894 co-relation queries the response was YES. [2025-03-15 01:03:35,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 573 events. 77/573 cut-off events. For 834/894 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2400 event pairs, 38 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 775. Up to 136 conditions per place. [2025-03-15 01:03:35,180 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 13 selfloop transitions, 2 changer transitions 15/238 dead transitions. [2025-03-15 01:03:35,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 238 transitions, 695 flow [2025-03-15 01:03:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-15 01:03:35,186 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8547619047619047 [2025-03-15 01:03:35,186 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -30 predicate places. [2025-03-15 01:03:35,186 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 238 transitions, 695 flow [2025-03-15 01:03:35,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:03:35,187 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:35,187 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] [2025-03-15 01:03:35,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:03:35,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:35,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1523148615, now seen corresponding path program 1 times [2025-03-15 01:03:35,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:35,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701389465] [2025-03-15 01:03:35,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:35,228 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:03:35,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701389465] [2025-03-15 01:03:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701389465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:35,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609297110] [2025-03-15 01:03:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:35,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:35,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:35,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:35,232 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-15 01:03:35,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 238 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:03:35,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:35,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-15 01:03:35,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:35,304 INFO L124 PetriNetUnfolderBase]: 77/572 cut-off events. [2025-03-15 01:03:35,304 INFO L125 PetriNetUnfolderBase]: For 1174/1240 co-relation queries the response was YES. [2025-03-15 01:03:35,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 572 events. 77/572 cut-off events. For 1174/1240 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2397 event pairs, 38 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 832. Up to 136 conditions per place. [2025-03-15 01:03:35,307 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 14 selfloop transitions, 2 changer transitions 15/237 dead transitions. [2025-03-15 01:03:35,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 237 transitions, 725 flow [2025-03-15 01:03:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-15 01:03:35,309 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-15 01:03:35,309 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -29 predicate places. [2025-03-15 01:03:35,309 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 237 transitions, 725 flow [2025-03-15 01:03:35,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:03:35,310 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:35,310 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] [2025-03-15 01:03:35,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:03:35,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:35,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:35,311 INFO L85 PathProgramCache]: Analyzing trace with hash 209980054, now seen corresponding path program 1 times [2025-03-15 01:03:35,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:35,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139025240] [2025-03-15 01:03:35,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:35,354 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:03:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139025240] [2025-03-15 01:03:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139025240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:35,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085776125] [2025-03-15 01:03:35,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:35,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:35,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:35,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:35,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:35,355 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 280 [2025-03-15 01:03:35,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 237 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:03:35,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:35,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 280 [2025-03-15 01:03:35,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:35,426 INFO L124 PetriNetUnfolderBase]: 77/571 cut-off events. [2025-03-15 01:03:35,427 INFO L125 PetriNetUnfolderBase]: For 1560/1632 co-relation queries the response was YES. [2025-03-15 01:03:35,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 571 events. 77/571 cut-off events. For 1560/1632 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2387 event pairs, 38 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 889. Up to 136 conditions per place. [2025-03-15 01:03:35,432 INFO L140 encePairwiseOnDemand]: 278/280 looper letters, 14 selfloop transitions, 1 changer transitions 15/236 dead transitions. [2025-03-15 01:03:35,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 236 transitions, 751 flow [2025-03-15 01:03:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-15 01:03:35,434 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-15 01:03:35,435 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -28 predicate places. [2025-03-15 01:03:35,435 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 236 transitions, 751 flow [2025-03-15 01:03:35,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:03:35,435 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:35,436 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] [2025-03-15 01:03:35,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:03:35,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:35,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash 751335505, now seen corresponding path program 1 times [2025-03-15 01:03:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:35,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712494131] [2025-03-15 01:03:35,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:35,497 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:03:35,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:35,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712494131] [2025-03-15 01:03:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712494131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:35,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:35,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439590198] [2025-03-15 01:03:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:35,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:35,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:35,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:35,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:35,500 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-15 01:03:35,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 236 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:03:35,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:35,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-15 01:03:35,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:35,571 INFO L124 PetriNetUnfolderBase]: 77/570 cut-off events. [2025-03-15 01:03:35,571 INFO L125 PetriNetUnfolderBase]: For 1999/2077 co-relation queries the response was YES. [2025-03-15 01:03:35,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 570 events. 77/570 cut-off events. For 1999/2077 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2381 event pairs, 38 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 946. Up to 136 conditions per place. [2025-03-15 01:03:35,574 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 14 selfloop transitions, 2 changer transitions 15/235 dead transitions. [2025-03-15 01:03:35,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 235 transitions, 781 flow [2025-03-15 01:03:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-15 01:03:35,575 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-15 01:03:35,577 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -27 predicate places. [2025-03-15 01:03:35,577 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 235 transitions, 781 flow [2025-03-15 01:03:35,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:03:35,578 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:35,578 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] [2025-03-15 01:03:35,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:03:35,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:35,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1444554029, now seen corresponding path program 1 times [2025-03-15 01:03:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:35,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793054161] [2025-03-15 01:03:35,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:35,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:36,033 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:03:36,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:36,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793054161] [2025-03-15 01:03:36,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793054161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:36,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:03:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464034301] [2025-03-15 01:03:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:36,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:03:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:36,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:03:36,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:03:36,037 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 280 [2025-03-15 01:03:36,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 235 transitions, 781 flow. Second operand has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 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:03:36,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:36,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 280 [2025-03-15 01:03:36,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:36,156 INFO L124 PetriNetUnfolderBase]: 77/569 cut-off events. [2025-03-15 01:03:36,157 INFO L125 PetriNetUnfolderBase]: For 2482/2566 co-relation queries the response was YES. [2025-03-15 01:03:36,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 569 events. 77/569 cut-off events. For 2482/2566 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2379 event pairs, 38 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 1003. Up to 136 conditions per place. [2025-03-15 01:03:36,160 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 24 selfloop transitions, 5 changer transitions 15/234 dead transitions. [2025-03-15 01:03:36,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 234 transitions, 837 flow [2025-03-15 01:03:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:03:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:03:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1352 transitions. [2025-03-15 01:03:36,163 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8047619047619048 [2025-03-15 01:03:36,164 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -23 predicate places. [2025-03-15 01:03:36,164 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 234 transitions, 837 flow [2025-03-15 01:03:36,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 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:03:36,165 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:36,165 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] [2025-03-15 01:03:36,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:03:36,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:36,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 702236979, now seen corresponding path program 1 times [2025-03-15 01:03:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574271442] [2025-03-15 01:03:36,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:36,207 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:03:36,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:36,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574271442] [2025-03-15 01:03:36,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574271442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:36,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:36,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:36,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589309389] [2025-03-15 01:03:36,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:36,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:36,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:36,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:36,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:36,209 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 280 [2025-03-15 01:03:36,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 234 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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:03:36,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:36,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 280 [2025-03-15 01:03:36,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:36,273 INFO L124 PetriNetUnfolderBase]: 73/559 cut-off events. [2025-03-15 01:03:36,274 INFO L125 PetriNetUnfolderBase]: For 3168/3332 co-relation queries the response was YES. [2025-03-15 01:03:36,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 559 events. 73/559 cut-off events. For 3168/3332 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2317 event pairs, 36 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 1016. Up to 132 conditions per place. [2025-03-15 01:03:36,278 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 16 selfloop transitions, 1 changer transitions 17/231 dead transitions. [2025-03-15 01:03:36,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 231 transitions, 863 flow [2025-03-15 01:03:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2025-03-15 01:03:36,280 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8357142857142857 [2025-03-15 01:03:36,280 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -24 predicate places. [2025-03-15 01:03:36,281 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 231 transitions, 863 flow [2025-03-15 01:03:36,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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:03:36,281 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:36,281 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] [2025-03-15 01:03:36,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:03:36,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:36,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash -828715229, now seen corresponding path program 1 times [2025-03-15 01:03:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:36,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883414974] [2025-03-15 01:03:36,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:36,331 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:03:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:36,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883414974] [2025-03-15 01:03:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883414974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:36,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580248817] [2025-03-15 01:03:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:36,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:36,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:36,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:36,333 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 280 [2025-03-15 01:03:36,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 231 transitions, 863 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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:03:36,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:36,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 280 [2025-03-15 01:03:36,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:36,442 INFO L124 PetriNetUnfolderBase]: 103/606 cut-off events. [2025-03-15 01:03:36,442 INFO L125 PetriNetUnfolderBase]: For 5657/5855 co-relation queries the response was YES. [2025-03-15 01:03:36,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1882 conditions, 606 events. 103/606 cut-off events. For 5657/5855 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2737 event pairs, 41 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1521. Up to 168 conditions per place. [2025-03-15 01:03:36,447 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 21 selfloop transitions, 5 changer transitions 17/231 dead transitions. [2025-03-15 01:03:36,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 231 transitions, 978 flow [2025-03-15 01:03:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2025-03-15 01:03:36,449 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2025-03-15 01:03:36,449 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -25 predicate places. [2025-03-15 01:03:36,449 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 231 transitions, 978 flow [2025-03-15 01:03:36,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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:03:36,449 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:36,450 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] [2025-03-15 01:03:36,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:03:36,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:36,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1826350202, now seen corresponding path program 1 times [2025-03-15 01:03:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:36,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3903110] [2025-03-15 01:03:36,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:36,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:36,496 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:03:36,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:36,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3903110] [2025-03-15 01:03:36,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3903110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:36,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:36,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:36,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328423576] [2025-03-15 01:03:36,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:36,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:36,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:36,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:36,498 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 280 [2025-03-15 01:03:36,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 231 transitions, 978 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 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:03:36,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:36,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 280 [2025-03-15 01:03:36,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:36,586 INFO L124 PetriNetUnfolderBase]: 104/564 cut-off events. [2025-03-15 01:03:36,586 INFO L125 PetriNetUnfolderBase]: For 7104/7314 co-relation queries the response was YES. [2025-03-15 01:03:36,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 564 events. 104/564 cut-off events. For 7104/7314 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2490 event pairs, 12 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 1759. Up to 152 conditions per place. [2025-03-15 01:03:36,591 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 30 selfloop transitions, 3 changer transitions 17/239 dead transitions. [2025-03-15 01:03:36,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 239 transitions, 1242 flow [2025-03-15 01:03:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2025-03-15 01:03:36,593 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.844047619047619 [2025-03-15 01:03:36,594 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -26 predicate places. [2025-03-15 01:03:36,594 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 239 transitions, 1242 flow [2025-03-15 01:03:36,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 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:03:36,594 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:36,594 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] [2025-03-15 01:03:36,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:03:36,595 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:36,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash -836485568, now seen corresponding path program 1 times [2025-03-15 01:03:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:36,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580890735] [2025-03-15 01:03:36,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:36,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:36,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580890735] [2025-03-15 01:03:36,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580890735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:36,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884666600] [2025-03-15 01:03:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:36,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:36,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:36,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:36,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:36,645 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 280 [2025-03-15 01:03:36,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 239 transitions, 1242 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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:03:36,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:36,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 280 [2025-03-15 01:03:36,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:36,749 INFO L124 PetriNetUnfolderBase]: 154/669 cut-off events. [2025-03-15 01:03:36,750 INFO L125 PetriNetUnfolderBase]: For 15829/16043 co-relation queries the response was YES. [2025-03-15 01:03:36,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 669 events. 154/669 cut-off events. For 15829/16043 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3309 event pairs, 40 based on Foata normal form. 8/558 useless extension candidates. Maximal degree in co-relation 2509. Up to 202 conditions per place. [2025-03-15 01:03:36,758 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 37 selfloop transitions, 2 changer transitions 17/243 dead transitions. [2025-03-15 01:03:36,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 243 transitions, 1453 flow [2025-03-15 01:03:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2025-03-15 01:03:36,760 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8357142857142857 [2025-03-15 01:03:36,761 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -25 predicate places. [2025-03-15 01:03:36,761 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 243 transitions, 1453 flow [2025-03-15 01:03:36,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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:03:36,761 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:36,761 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] [2025-03-15 01:03:36,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:03:36,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:36,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash -419130325, now seen corresponding path program 1 times [2025-03-15 01:03:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:36,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310587909] [2025-03-15 01:03:36,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:36,806 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:03:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310587909] [2025-03-15 01:03:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310587909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292854319] [2025-03-15 01:03:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:36,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:36,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:36,808 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 280 [2025-03-15 01:03:36,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 243 transitions, 1453 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:03:36,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:36,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 280 [2025-03-15 01:03:36,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:36,939 INFO L124 PetriNetUnfolderBase]: 157/668 cut-off events. [2025-03-15 01:03:36,940 INFO L125 PetriNetUnfolderBase]: For 17517/17810 co-relation queries the response was YES. [2025-03-15 01:03:36,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 668 events. 157/668 cut-off events. For 17517/17810 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3330 event pairs, 40 based on Foata normal form. 6/558 useless extension candidates. Maximal degree in co-relation 2735. Up to 205 conditions per place. [2025-03-15 01:03:36,946 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 41 selfloop transitions, 2 changer transitions 17/245 dead transitions. [2025-03-15 01:03:36,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 245 transitions, 1622 flow [2025-03-15 01:03:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2025-03-15 01:03:36,948 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8238095238095238 [2025-03-15 01:03:36,950 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -24 predicate places. [2025-03-15 01:03:36,950 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 245 transitions, 1622 flow [2025-03-15 01:03:36,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:03:36,950 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:36,950 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] [2025-03-15 01:03:36,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:03:36,951 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:36,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1432066561, now seen corresponding path program 1 times [2025-03-15 01:03:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:36,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946504587] [2025-03-15 01:03:36,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:36,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:36,998 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:03:36,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:36,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946504587] [2025-03-15 01:03:36,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946504587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:36,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:36,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:36,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625507351] [2025-03-15 01:03:36,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:36,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:36,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:36,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:36,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:37,000 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 280 [2025-03-15 01:03:37,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 245 transitions, 1622 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:03:37,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:37,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 280 [2025-03-15 01:03:37,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:37,135 INFO L124 PetriNetUnfolderBase]: 160/667 cut-off events. [2025-03-15 01:03:37,135 INFO L125 PetriNetUnfolderBase]: For 20388/20847 co-relation queries the response was YES. [2025-03-15 01:03:37,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3548 conditions, 667 events. 160/667 cut-off events. For 20388/20847 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3295 event pairs, 40 based on Foata normal form. 3/557 useless extension candidates. Maximal degree in co-relation 2959. Up to 208 conditions per place. [2025-03-15 01:03:37,143 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 43 selfloop transitions, 2 changer transitions 17/247 dead transitions. [2025-03-15 01:03:37,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 247 transitions, 1799 flow [2025-03-15 01:03:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2025-03-15 01:03:37,144 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8226190476190476 [2025-03-15 01:03:37,145 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -23 predicate places. [2025-03-15 01:03:37,145 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 247 transitions, 1799 flow [2025-03-15 01:03:37,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:03:37,145 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:37,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:03:37,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:37,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1955903985, now seen corresponding path program 1 times [2025-03-15 01:03:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685942037] [2025-03-15 01:03:37,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:37,187 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:03:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685942037] [2025-03-15 01:03:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685942037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:37,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706953761] [2025-03-15 01:03:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:37,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:37,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:37,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:37,190 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 280 [2025-03-15 01:03:37,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 247 transitions, 1799 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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:03:37,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:37,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 280 [2025-03-15 01:03:37,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:37,334 INFO L124 PetriNetUnfolderBase]: 154/663 cut-off events. [2025-03-15 01:03:37,334 INFO L125 PetriNetUnfolderBase]: For 22742/23378 co-relation queries the response was YES. [2025-03-15 01:03:37,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3664 conditions, 663 events. 154/663 cut-off events. For 22742/23378 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3145 event pairs, 31 based on Foata normal form. 2/569 useless extension candidates. Maximal degree in co-relation 3060. Up to 203 conditions per place. [2025-03-15 01:03:37,341 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 43 selfloop transitions, 2 changer transitions 21/250 dead transitions. [2025-03-15 01:03:37,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 250 transitions, 2048 flow [2025-03-15 01:03:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-15 01:03:37,344 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2025-03-15 01:03:37,344 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -23 predicate places. [2025-03-15 01:03:37,345 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 250 transitions, 2048 flow [2025-03-15 01:03:37,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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:03:37,346 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:37,346 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] [2025-03-15 01:03:37,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:03:37,346 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:37,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1153165294, now seen corresponding path program 1 times [2025-03-15 01:03:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:37,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627543911] [2025-03-15 01:03:37,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:37,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:37,400 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:03:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:37,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627543911] [2025-03-15 01:03:37,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627543911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:37,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:37,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:37,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984777475] [2025-03-15 01:03:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:37,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:37,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:37,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:37,403 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 280 [2025-03-15 01:03:37,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 250 transitions, 2048 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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:03:37,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:37,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 280 [2025-03-15 01:03:37,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:37,574 INFO L124 PetriNetUnfolderBase]: 159/661 cut-off events. [2025-03-15 01:03:37,574 INFO L125 PetriNetUnfolderBase]: For 26660/27484 co-relation queries the response was YES. [2025-03-15 01:03:37,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 661 events. 159/661 cut-off events. For 26660/27484 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3162 event pairs, 25 based on Foata normal form. 6/577 useless extension candidates. Maximal degree in co-relation 3297. Up to 208 conditions per place. [2025-03-15 01:03:37,584 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 49 selfloop transitions, 2 changer transitions 21/254 dead transitions. [2025-03-15 01:03:37,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 2321 flow [2025-03-15 01:03:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2025-03-15 01:03:37,586 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2025-03-15 01:03:37,587 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -22 predicate places. [2025-03-15 01:03:37,587 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 254 transitions, 2321 flow [2025-03-15 01:03:37,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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:03:37,588 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:37,588 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] [2025-03-15 01:03:37,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:03:37,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:37,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1497266155, now seen corresponding path program 1 times [2025-03-15 01:03:37,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:37,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26721594] [2025-03-15 01:03:37,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:37,636 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:03:37,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:37,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26721594] [2025-03-15 01:03:37,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26721594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:37,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:37,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:37,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877442092] [2025-03-15 01:03:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:37,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:37,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:37,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:37,638 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 280 [2025-03-15 01:03:37,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 254 transitions, 2321 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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:03:37,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:37,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 280 [2025-03-15 01:03:37,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:37,790 INFO L124 PetriNetUnfolderBase]: 194/716 cut-off events. [2025-03-15 01:03:37,790 INFO L125 PetriNetUnfolderBase]: For 39229/40263 co-relation queries the response was YES. [2025-03-15 01:03:37,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4813 conditions, 716 events. 194/716 cut-off events. For 39229/40263 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3561 event pairs, 27 based on Foata normal form. 10/631 useless extension candidates. Maximal degree in co-relation 4001. Up to 247 conditions per place. [2025-03-15 01:03:37,797 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 50 selfloop transitions, 2 changer transitions 25/257 dead transitions. [2025-03-15 01:03:37,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 257 transitions, 2610 flow [2025-03-15 01:03:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-15 01:03:37,798 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-15 01:03:37,799 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -22 predicate places. [2025-03-15 01:03:37,799 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 257 transitions, 2610 flow [2025-03-15 01:03:37,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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:03:37,799 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:37,799 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:03:37,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:03:37,799 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:37,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1968275216, now seen corresponding path program 1 times [2025-03-15 01:03:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471417803] [2025-03-15 01:03:37,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:37,939 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:03:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471417803] [2025-03-15 01:03:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471417803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:37,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:37,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:03:37,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362649627] [2025-03-15 01:03:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:37,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:37,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:37,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:37,941 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-15 01:03:37,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 257 transitions, 2610 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:03:37,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:37,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-15 01:03:37,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:38,058 INFO L124 PetriNetUnfolderBase]: 152/687 cut-off events. [2025-03-15 01:03:38,058 INFO L125 PetriNetUnfolderBase]: For 31773/32525 co-relation queries the response was YES. [2025-03-15 01:03:38,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 687 events. 152/687 cut-off events. For 31773/32525 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3499 event pairs, 30 based on Foata normal form. 3/607 useless extension candidates. Maximal degree in co-relation 3436. Up to 203 conditions per place. [2025-03-15 01:03:38,066 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 39 selfloop transitions, 5 changer transitions 25/250 dead transitions. [2025-03-15 01:03:38,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 250 transitions, 2437 flow [2025-03-15 01:03:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2025-03-15 01:03:38,068 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2025-03-15 01:03:38,069 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -20 predicate places. [2025-03-15 01:03:38,069 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 250 transitions, 2437 flow [2025-03-15 01:03:38,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:03:38,069 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:38,069 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] [2025-03-15 01:03:38,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:03:38,069 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-15 01:03:38,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash 537767969, now seen corresponding path program 1 times [2025-03-15 01:03:38,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:38,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362536487] [2025-03-15 01:03:38,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:38,125 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:03:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:38,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362536487] [2025-03-15 01:03:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362536487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:38,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431851112] [2025-03-15 01:03:38,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:38,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:38,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:38,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:38,129 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 280 [2025-03-15 01:03:38,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 250 transitions, 2437 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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:03:38,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:38,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 280 [2025-03-15 01:03:38,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:38,290 INFO L124 PetriNetUnfolderBase]: 181/716 cut-off events. [2025-03-15 01:03:38,291 INFO L125 PetriNetUnfolderBase]: For 40569/41507 co-relation queries the response was YES. [2025-03-15 01:03:38,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5010 conditions, 716 events. 181/716 cut-off events. For 40569/41507 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3408 event pairs, 25 based on Foata normal form. 7/630 useless extension candidates. Maximal degree in co-relation 3982. Up to 237 conditions per place. [2025-03-15 01:03:38,296 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 0 selfloop transitions, 0 changer transitions 252/252 dead transitions. [2025-03-15 01:03:38,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 252 transitions, 2660 flow [2025-03-15 01:03:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-15 01:03:38,298 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8404761904761905 [2025-03-15 01:03:38,299 INFO L298 CegarLoopForPetriNet]: 277 programPoint places, -19 predicate places. [2025-03-15 01:03:38,299 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 252 transitions, 2660 flow [2025-03-15 01:03:38,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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:03:38,308 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-queue-add-2-nl.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:03:38,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2025-03-15 01:03:38,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2025-03-15 01:03:38,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2025-03-15 01:03:38,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2025-03-15 01:03:38,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2025-03-15 01:03:38,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2025-03-15 01:03:38,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2025-03-15 01:03:38,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2025-03-15 01:03:38,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2025-03-15 01:03:38,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (38 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2025-03-15 01:03:38,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2025-03-15 01:03:38,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2025-03-15 01:03:38,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:03:38,351 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:38,356 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:03:38,356 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:03:38,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:03:38 BasicIcfg [2025-03-15 01:03:38,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:03:38,362 INFO L158 Benchmark]: Toolchain (without parser) took 5585.77ms. Allocated memory was 71.3MB in the beginning and 276.8MB in the end (delta: 205.5MB). Free memory was 45.2MB in the beginning and 95.3MB in the end (delta: -50.2MB). Peak memory consumption was 154.6MB. Max. memory is 8.0GB. [2025-03-15 01:03:38,362 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 71.3MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:03:38,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.32ms. Allocated memory is still 71.3MB. Free memory was 45.0MB in the beginning and 32.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:03:38,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.21ms. Allocated memory is still 71.3MB. Free memory was 32.2MB in the beginning and 29.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:03:38,363 INFO L158 Benchmark]: Boogie Preprocessor took 33.19ms. Allocated memory is still 71.3MB. Free memory was 29.8MB in the beginning and 27.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:03:38,363 INFO L158 Benchmark]: RCFGBuilder took 824.59ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 27.9MB in the beginning and 46.9MB in the end (delta: -18.9MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. [2025-03-15 01:03:38,363 INFO L158 Benchmark]: TraceAbstraction took 4492.18ms. Allocated memory was 88.1MB in the beginning and 276.8MB in the end (delta: 188.7MB). Free memory was 45.9MB in the beginning and 95.3MB in the end (delta: -49.4MB). Peak memory consumption was 135.5MB. Max. memory is 8.0GB. [2025-03-15 01:03:38,364 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 71.3MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.32ms. Allocated memory is still 71.3MB. Free memory was 45.0MB in the beginning and 32.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.21ms. Allocated memory is still 71.3MB. Free memory was 32.2MB in the beginning and 29.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.19ms. Allocated memory is still 71.3MB. Free memory was 29.8MB in the beginning and 27.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 824.59ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 27.9MB in the beginning and 46.9MB in the end (delta: -18.9MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. * TraceAbstraction took 4492.18ms. Allocated memory was 88.1MB in the beginning and 276.8MB in the end (delta: 188.7MB). Free memory was 45.9MB in the beginning and 95.3MB in the end (delta: -49.4MB). Peak memory consumption was 135.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: 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: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 62]: 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: 62]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 372 locations, 94 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: 4.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 465 IncrementalHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 157 mSDtfsCounter, 465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2660occurred in iteration=20, InterpolantAutomatonStates: 63, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1794 NumberOfCodeBlocks, 1794 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1774 ConstructedInterpolants, 0 QuantifiedInterpolants, 2053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:03:38,385 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...