/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/goblint-regression/04-mutex_10-ptrmunge_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:25:00,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:25:00,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:25:00,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:25:00,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:25:00,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:25:00,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:25:00,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:25:00,922 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:25:00,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:25:00,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:25:00,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:25:00,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:25:00,924 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:25:00,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:25:00,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:00,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:25:00,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:25:00,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:25:00,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:25:00,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:25:00,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:25:00,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:25:01,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:25:01,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:25:01,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:25:01,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:25:01,226 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:25:01,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_10-ptrmunge_nr.i [2025-03-15 00:25:02,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b6813d2/be1be3e69dd74daeaec5ed78848cea06/FLAG5cc2aa5c4 [2025-03-15 00:25:02,645 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:25:02,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_10-ptrmunge_nr.i [2025-03-15 00:25:02,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b6813d2/be1be3e69dd74daeaec5ed78848cea06/FLAG5cc2aa5c4 [2025-03-15 00:25:02,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b6813d2/be1be3e69dd74daeaec5ed78848cea06 [2025-03-15 00:25:02,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:25:02,681 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:25:02,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:02,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:25:02,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:25:02,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:02" (1/1) ... [2025-03-15 00:25:02,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32bfcc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:02, skipping insertion in model container [2025-03-15 00:25:02,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:02" (1/1) ... [2025-03-15 00:25:02,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:25:03,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:03,080 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:25:03,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:03,188 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:25:03,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03 WrapperNode [2025-03-15 00:25:03,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:03,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:03,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:25:03,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:25:03,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,223 INFO L138 Inliner]: procedures = 263, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2025-03-15 00:25:03,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:03,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:25:03,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:25:03,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:25:03,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:25:03,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:25:03,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:25:03,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:25:03,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (1/1) ... [2025-03-15 00:25:03,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:03,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:03,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:25:03,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:25:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:25:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:25:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:25:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:25:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:25:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:25:03,299 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:25:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:25:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:25:03,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:25:03,300 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:25:03,387 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:25:03,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:25:03,559 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:25:03,559 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:25:03,581 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:25:03,581 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:25:03,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:03 BoogieIcfgContainer [2025-03-15 00:25:03,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:25:03,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:25:03,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:25:03,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:25:03,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:25:02" (1/3) ... [2025-03-15 00:25:03,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448e89f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:03, skipping insertion in model container [2025-03-15 00:25:03,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:03" (2/3) ... [2025-03-15 00:25:03,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448e89f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:03, skipping insertion in model container [2025-03-15 00:25:03,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:03" (3/3) ... [2025-03-15 00:25:03,593 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_10-ptrmunge_nr.i [2025-03-15 00:25:03,631 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:25:03,633 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_10-ptrmunge_nr.i that has 2 procedures, 95 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-15 00:25:03,633 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:25:03,688 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 00:25:03,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:25:03,733 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;@665da6b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:25:03,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-15 00:25:03,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:25:03,767 INFO L124 PetriNetUnfolderBase]: 0/53 cut-off events. [2025-03-15 00:25:03,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:25:03,771 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:03,771 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:25:03,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:03,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1709663426, now seen corresponding path program 1 times [2025-03-15 00:25:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:03,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405044001] [2025-03-15 00:25:03,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:04,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:04,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405044001] [2025-03-15 00:25:04,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405044001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:04,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:04,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:04,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183350471] [2025-03-15 00:25:04,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:04,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:04,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:04,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:04,417 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 94 [2025-03-15 00:25:04,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:04,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:04,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 94 [2025-03-15 00:25:04,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:04,819 INFO L124 PetriNetUnfolderBase]: 294/865 cut-off events. [2025-03-15 00:25:04,819 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 00:25:04,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 865 events. 294/865 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4835 event pairs, 171 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1458. Up to 473 conditions per place. [2025-03-15 00:25:04,831 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 74 selfloop transitions, 22 changer transitions 5/155 dead transitions. [2025-03-15 00:25:04,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 155 transitions, 510 flow [2025-03-15 00:25:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 452 transitions. [2025-03-15 00:25:04,840 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8014184397163121 [2025-03-15 00:25:04,842 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2025-03-15 00:25:04,842 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 155 transitions, 510 flow [2025-03-15 00:25:04,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:04,843 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:04,843 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] [2025-03-15 00:25:04,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:25:04,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:04,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash 914001375, now seen corresponding path program 1 times [2025-03-15 00:25:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998104913] [2025-03-15 00:25:04,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:05,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:05,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998104913] [2025-03-15 00:25:05,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998104913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:05,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:05,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:05,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740893061] [2025-03-15 00:25:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:05,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:05,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:05,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:05,087 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 94 [2025-03-15 00:25:05,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 155 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:05,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:05,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 94 [2025-03-15 00:25:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:05,413 INFO L124 PetriNetUnfolderBase]: 395/1099 cut-off events. [2025-03-15 00:25:05,414 INFO L125 PetriNetUnfolderBase]: For 136/171 co-relation queries the response was YES. [2025-03-15 00:25:05,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 1099 events. 395/1099 cut-off events. For 136/171 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6307 event pairs, 181 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 2597. Up to 594 conditions per place. [2025-03-15 00:25:05,420 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 107 selfloop transitions, 42 changer transitions 5/209 dead transitions. [2025-03-15 00:25:05,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 209 transitions, 1024 flow [2025-03-15 00:25:05,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 448 transitions. [2025-03-15 00:25:05,423 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7943262411347518 [2025-03-15 00:25:05,424 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2025-03-15 00:25:05,424 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 209 transitions, 1024 flow [2025-03-15 00:25:05,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:05,424 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:05,424 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] [2025-03-15 00:25:05,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:25:05,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:05,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1024991904, now seen corresponding path program 1 times [2025-03-15 00:25:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946222163] [2025-03-15 00:25:05,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:05,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:05,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946222163] [2025-03-15 00:25:05,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946222163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:05,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:05,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:05,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278833886] [2025-03-15 00:25:05,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:05,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:05,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:05,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:05,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:05,669 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 94 [2025-03-15 00:25:05,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 209 transitions, 1024 flow. Second operand has 6 states, 6 states have (on average 59.833333333333336) internal successors, (359), 6 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:05,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:05,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 94 [2025-03-15 00:25:05,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:05,976 INFO L124 PetriNetUnfolderBase]: 506/1348 cut-off events. [2025-03-15 00:25:05,977 INFO L125 PetriNetUnfolderBase]: For 407/474 co-relation queries the response was YES. [2025-03-15 00:25:05,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 1348 events. 506/1348 cut-off events. For 407/474 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7985 event pairs, 155 based on Foata normal form. 0/1259 useless extension candidates. Maximal degree in co-relation 4176. Up to 830 conditions per place. [2025-03-15 00:25:05,983 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 151 selfloop transitions, 57 changer transitions 21/282 dead transitions. [2025-03-15 00:25:05,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 282 transitions, 1908 flow [2025-03-15 00:25:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 441 transitions. [2025-03-15 00:25:05,984 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7819148936170213 [2025-03-15 00:25:05,985 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 14 predicate places. [2025-03-15 00:25:05,985 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 282 transitions, 1908 flow [2025-03-15 00:25:05,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.833333333333336) internal successors, (359), 6 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:05,985 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:05,985 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:25:05,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:25:05,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:05,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1016274529, now seen corresponding path program 1 times [2025-03-15 00:25:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098444941] [2025-03-15 00:25:05,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:05,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:06,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:06,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098444941] [2025-03-15 00:25:06,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098444941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:06,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:06,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:06,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767023024] [2025-03-15 00:25:06,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:06,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:06,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:06,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:06,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:06,169 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 94 [2025-03-15 00:25:06,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 282 transitions, 1908 flow. Second operand has 6 states, 6 states have (on average 59.833333333333336) internal successors, (359), 6 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:06,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:06,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 94 [2025-03-15 00:25:06,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:06,522 INFO L124 PetriNetUnfolderBase]: 646/1637 cut-off events. [2025-03-15 00:25:06,522 INFO L125 PetriNetUnfolderBase]: For 824/865 co-relation queries the response was YES. [2025-03-15 00:25:06,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6340 conditions, 1637 events. 646/1637 cut-off events. For 824/865 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9951 event pairs, 149 based on Foata normal form. 0/1543 useless extension candidates. Maximal degree in co-relation 6289. Up to 1016 conditions per place. [2025-03-15 00:25:06,533 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 196 selfloop transitions, 58 changer transitions 55/363 dead transitions. [2025-03-15 00:25:06,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 363 transitions, 3160 flow [2025-03-15 00:25:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 441 transitions. [2025-03-15 00:25:06,534 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7819148936170213 [2025-03-15 00:25:06,535 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 19 predicate places. [2025-03-15 00:25:06,535 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 363 transitions, 3160 flow [2025-03-15 00:25:06,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.833333333333336) internal successors, (359), 6 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:06,535 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:06,535 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 00:25:06,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:25:06,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash 213979997, now seen corresponding path program 1 times [2025-03-15 00:25:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:06,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032084785] [2025-03-15 00:25:06,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:06,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:06,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032084785] [2025-03-15 00:25:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032084785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:06,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:06,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:06,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691877053] [2025-03-15 00:25:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:06,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:06,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:06,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:06,895 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:25:06,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 363 transitions, 3160 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:06,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:06,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:25:06,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:07,965 INFO L124 PetriNetUnfolderBase]: 1438/3318 cut-off events. [2025-03-15 00:25:07,965 INFO L125 PetriNetUnfolderBase]: For 3102/3114 co-relation queries the response was YES. [2025-03-15 00:25:07,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15553 conditions, 3318 events. 1438/3318 cut-off events. For 3102/3114 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 22487 event pairs, 92 based on Foata normal form. 0/3169 useless extension candidates. Maximal degree in co-relation 15495. Up to 2046 conditions per place. [2025-03-15 00:25:07,981 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 593 selfloop transitions, 71 changer transitions 179/883 dead transitions. [2025-03-15 00:25:07,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 883 transitions, 9724 flow [2025-03-15 00:25:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 908 transitions. [2025-03-15 00:25:07,984 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6439716312056738 [2025-03-15 00:25:07,985 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 33 predicate places. [2025-03-15 00:25:07,985 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 883 transitions, 9724 flow [2025-03-15 00:25:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:07,985 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:07,985 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 00:25:07,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:25:07,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:07,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash 311043909, now seen corresponding path program 1 times [2025-03-15 00:25:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488058974] [2025-03-15 00:25:07,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:08,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488058974] [2025-03-15 00:25:08,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488058974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:08,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:08,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:08,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541313125] [2025-03-15 00:25:08,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:08,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:08,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:08,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:08,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:08,322 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:25:08,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 883 transitions, 9724 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:08,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:08,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:25:08,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:09,750 INFO L124 PetriNetUnfolderBase]: 2136/4822 cut-off events. [2025-03-15 00:25:09,750 INFO L125 PetriNetUnfolderBase]: For 5833/5853 co-relation queries the response was YES. [2025-03-15 00:25:09,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26795 conditions, 4822 events. 2136/4822 cut-off events. For 5833/5853 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 35222 event pairs, 88 based on Foata normal form. 0/4621 useless extension candidates. Maximal degree in co-relation 26730. Up to 2977 conditions per place. [2025-03-15 00:25:09,782 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 974 selfloop transitions, 93 changer transitions 333/1445 dead transitions. [2025-03-15 00:25:09,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 1445 transitions, 18848 flow [2025-03-15 00:25:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 908 transitions. [2025-03-15 00:25:09,785 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6439716312056738 [2025-03-15 00:25:09,786 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 47 predicate places. [2025-03-15 00:25:09,786 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 1445 transitions, 18848 flow [2025-03-15 00:25:09,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:09,786 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:09,787 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 00:25:09,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:25:09,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:09,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2101701651, now seen corresponding path program 1 times [2025-03-15 00:25:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853675590] [2025-03-15 00:25:09,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:10,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853675590] [2025-03-15 00:25:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853675590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:10,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:10,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548827293] [2025-03-15 00:25:10,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:10,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:10,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:10,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:10,066 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:25:10,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 1445 transitions, 18848 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:10,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:10,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:25:10,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:12,139 INFO L124 PetriNetUnfolderBase]: 3519/7823 cut-off events. [2025-03-15 00:25:12,140 INFO L125 PetriNetUnfolderBase]: For 13214/13258 co-relation queries the response was YES. [2025-03-15 00:25:12,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50230 conditions, 7823 events. 3519/7823 cut-off events. For 13214/13258 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 63146 event pairs, 191 based on Foata normal form. 2/7468 useless extension candidates. Maximal degree in co-relation 50158. Up to 4915 conditions per place. [2025-03-15 00:25:12,182 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 1548 selfloop transitions, 194 changer transitions 528/2323 dead transitions. [2025-03-15 00:25:12,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 2323 transitions, 35232 flow [2025-03-15 00:25:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 00:25:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 00:25:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1047 transitions. [2025-03-15 00:25:12,185 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6961436170212766 [2025-03-15 00:25:12,186 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 62 predicate places. [2025-03-15 00:25:12,186 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 2323 transitions, 35232 flow [2025-03-15 00:25:12,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:12,186 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:12,186 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 00:25:12,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:25:12,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:12,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash -263090187, now seen corresponding path program 2 times [2025-03-15 00:25:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:12,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333459355] [2025-03-15 00:25:12,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:12,198 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:12,198 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:12,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 00:25:12,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:12,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333459355] [2025-03-15 00:25:12,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333459355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:12,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:12,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127630579] [2025-03-15 00:25:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:12,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:12,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:12,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:12,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:12,564 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:25:12,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 2323 transitions, 35232 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:12,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:12,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:25:12,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:15,520 INFO L124 PetriNetUnfolderBase]: 3629/8057 cut-off events. [2025-03-15 00:25:15,520 INFO L125 PetriNetUnfolderBase]: For 17386/17440 co-relation queries the response was YES. [2025-03-15 00:25:15,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58827 conditions, 8057 events. 3629/8057 cut-off events. For 17386/17440 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 65312 event pairs, 189 based on Foata normal form. 2/7699 useless extension candidates. Maximal degree in co-relation 58748. Up to 5100 conditions per place. [2025-03-15 00:25:15,563 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 1745 selfloop transitions, 141 changer transitions 591/2522 dead transitions. [2025-03-15 00:25:15,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 2522 transitions, 43084 flow [2025-03-15 00:25:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 983 transitions. [2025-03-15 00:25:15,566 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6971631205673758 [2025-03-15 00:25:15,566 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 76 predicate places. [2025-03-15 00:25:15,566 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 2522 transitions, 43084 flow [2025-03-15 00:25:15,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:15,566 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:15,567 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 00:25:15,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:25:15,567 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:15,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:15,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2115249303, now seen corresponding path program 1 times [2025-03-15 00:25:15,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:15,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589861574] [2025-03-15 00:25:15,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:15,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:15,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589861574] [2025-03-15 00:25:15,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589861574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:15,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336821774] [2025-03-15 00:25:15,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:15,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:15,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:15,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:15,960 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:25:15,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 2522 transitions, 43084 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:15,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:15,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:25:15,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:19,064 INFO L124 PetriNetUnfolderBase]: 3719/8242 cut-off events. [2025-03-15 00:25:19,064 INFO L125 PetriNetUnfolderBase]: For 23809/23873 co-relation queries the response was YES. [2025-03-15 00:25:19,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67036 conditions, 8242 events. 3719/8242 cut-off events. For 23809/23873 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 67003 event pairs, 198 based on Foata normal form. 2/7882 useless extension candidates. Maximal degree in co-relation 66950. Up to 5250 conditions per place. [2025-03-15 00:25:19,107 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 1821 selfloop transitions, 220 changer transitions 621/2726 dead transitions. [2025-03-15 00:25:19,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2726 transitions, 51876 flow [2025-03-15 00:25:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1005 transitions. [2025-03-15 00:25:19,110 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2025-03-15 00:25:19,110 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 90 predicate places. [2025-03-15 00:25:19,110 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 2726 transitions, 51876 flow [2025-03-15 00:25:19,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:19,111 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:19,111 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:25:19,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:25:19,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:19,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash 888233797, now seen corresponding path program 2 times [2025-03-15 00:25:19,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:19,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554176837] [2025-03-15 00:25:19,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:19,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:19,121 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:19,121 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:19,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554176837] [2025-03-15 00:25:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554176837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:19,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114595355] [2025-03-15 00:25:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:19,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:19,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:19,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:19,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:19,323 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:25:19,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 2726 transitions, 51876 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:19,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:19,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:25:19,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:22,355 INFO L124 PetriNetUnfolderBase]: 3688/8188 cut-off events. [2025-03-15 00:25:22,356 INFO L125 PetriNetUnfolderBase]: For 28282/28356 co-relation queries the response was YES. [2025-03-15 00:25:22,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73528 conditions, 8188 events. 3688/8188 cut-off events. For 28282/28356 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 66550 event pairs, 190 based on Foata normal form. 2/7864 useless extension candidates. Maximal degree in co-relation 73435. Up to 5191 conditions per place. [2025-03-15 00:25:22,408 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 1951 selfloop transitions, 168 changer transitions 690/2865 dead transitions. [2025-03-15 00:25:22,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 2865 transitions, 59992 flow [2025-03-15 00:25:22,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 00:25:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 00:25:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1027 transitions. [2025-03-15 00:25:22,411 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.682845744680851 [2025-03-15 00:25:22,411 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 105 predicate places. [2025-03-15 00:25:22,411 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 2865 transitions, 59992 flow [2025-03-15 00:25:22,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:22,412 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:22,412 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 00:25:22,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:25:22,412 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:22,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1484149437, now seen corresponding path program 3 times [2025-03-15 00:25:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358807005] [2025-03-15 00:25:22,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:25:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:22,423 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:25:22,423 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:22,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:22,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358807005] [2025-03-15 00:25:22,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358807005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:22,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:22,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127799089] [2025-03-15 00:25:22,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:22,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:22,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:22,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:22,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:22,653 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:25:22,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 2865 transitions, 59992 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:22,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:22,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:25:22,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:25,989 INFO L124 PetriNetUnfolderBase]: 3734/8301 cut-off events. [2025-03-15 00:25:25,989 INFO L125 PetriNetUnfolderBase]: For 34440/34526 co-relation queries the response was YES. [2025-03-15 00:25:26,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81494 conditions, 8301 events. 3734/8301 cut-off events. For 34440/34526 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 67730 event pairs, 191 based on Foata normal form. 2/7977 useless extension candidates. Maximal degree in co-relation 81394. Up to 5238 conditions per place. [2025-03-15 00:25:26,038 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 1930 selfloop transitions, 219 changer transitions 768/2969 dead transitions. [2025-03-15 00:25:26,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 2969 transitions, 67802 flow [2025-03-15 00:25:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:25:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:25:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 916 transitions. [2025-03-15 00:25:26,041 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6960486322188449 [2025-03-15 00:25:26,041 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 118 predicate places. [2025-03-15 00:25:26,041 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 2969 transitions, 67802 flow [2025-03-15 00:25:26,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:26,041 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:26,041 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 00:25:26,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:25:26,042 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:26,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash -459441033, now seen corresponding path program 2 times [2025-03-15 00:25:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:26,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025243093] [2025-03-15 00:25:26,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:26,051 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:26,051 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:26,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:26,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025243093] [2025-03-15 00:25:26,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025243093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:26,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:26,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:26,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639109522] [2025-03-15 00:25:26,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:26,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:26,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:26,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:26,310 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:25:26,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 2969 transitions, 67802 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:26,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:26,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:25:26,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:29,778 INFO L124 PetriNetUnfolderBase]: 3825/8507 cut-off events. [2025-03-15 00:25:29,778 INFO L125 PetriNetUnfolderBase]: For 44520/44618 co-relation queries the response was YES. [2025-03-15 00:25:29,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90241 conditions, 8507 events. 3825/8507 cut-off events. For 44520/44618 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 69747 event pairs, 195 based on Foata normal form. 4/8185 useless extension candidates. Maximal degree in co-relation 90134. Up to 5356 conditions per place. [2025-03-15 00:25:29,838 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 1915 selfloop transitions, 293 changer transitions 812/3091 dead transitions. [2025-03-15 00:25:29,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 3091 transitions, 76446 flow [2025-03-15 00:25:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:25:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:25:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 936 transitions. [2025-03-15 00:25:29,840 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7112462006079028 [2025-03-15 00:25:29,840 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 131 predicate places. [2025-03-15 00:25:29,840 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 3091 transitions, 76446 flow [2025-03-15 00:25:29,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:29,840 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:29,841 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 00:25:29,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:25:29,841 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:29,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1052063165, now seen corresponding path program 4 times [2025-03-15 00:25:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:29,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807775389] [2025-03-15 00:25:29,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:25:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:29,850 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:25:29,851 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:30,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:30,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807775389] [2025-03-15 00:25:30,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807775389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:30,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:30,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106259313] [2025-03-15 00:25:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:30,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:30,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:30,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:30,095 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:25:30,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 3091 transitions, 76446 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:30,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:30,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:25:30,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:33,718 INFO L124 PetriNetUnfolderBase]: 3920/8736 cut-off events. [2025-03-15 00:25:33,719 INFO L125 PetriNetUnfolderBase]: For 53278/53384 co-relation queries the response was YES. [2025-03-15 00:25:33,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99773 conditions, 8736 events. 3920/8736 cut-off events. For 53278/53384 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 72125 event pairs, 198 based on Foata normal form. 3/8413 useless extension candidates. Maximal degree in co-relation 99659. Up to 5481 conditions per place. [2025-03-15 00:25:33,780 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2026 selfloop transitions, 241 changer transitions 895/3214 dead transitions. [2025-03-15 00:25:33,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 3214 transitions, 85800 flow [2025-03-15 00:25:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 976 transitions. [2025-03-15 00:25:33,784 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6921985815602837 [2025-03-15 00:25:33,785 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 145 predicate places. [2025-03-15 00:25:33,785 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 3214 transitions, 85800 flow [2025-03-15 00:25:33,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:33,785 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:33,785 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 00:25:33,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:25:33,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:33,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:33,786 INFO L85 PathProgramCache]: Analyzing trace with hash 122240543, now seen corresponding path program 5 times [2025-03-15 00:25:33,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:33,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857134825] [2025-03-15 00:25:33,786 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:25:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:33,794 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:33,794 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:33,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:33,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857134825] [2025-03-15 00:25:33,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857134825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:33,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:33,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:33,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144177390] [2025-03-15 00:25:33,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:33,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:33,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:33,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:33,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:33,999 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:25:33,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 3214 transitions, 85800 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:33,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:33,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:25:33,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:38,103 INFO L124 PetriNetUnfolderBase]: 4047/9031 cut-off events. [2025-03-15 00:25:38,104 INFO L125 PetriNetUnfolderBase]: For 63823/63943 co-relation queries the response was YES. [2025-03-15 00:25:38,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110569 conditions, 9031 events. 4047/9031 cut-off events. For 63823/63943 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 75215 event pairs, 202 based on Foata normal form. 3/8707 useless extension candidates. Maximal degree in co-relation 110448. Up to 5654 conditions per place. [2025-03-15 00:25:38,160 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2097 selfloop transitions, 255 changer transitions 981/3385 dead transitions. [2025-03-15 00:25:38,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 3385 transitions, 97062 flow [2025-03-15 00:25:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 976 transitions. [2025-03-15 00:25:38,161 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6921985815602837 [2025-03-15 00:25:38,162 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 159 predicate places. [2025-03-15 00:25:38,162 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 3385 transitions, 97062 flow [2025-03-15 00:25:38,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:38,162 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:38,162 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 00:25:38,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:25:38,162 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:38,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1969705301, now seen corresponding path program 6 times [2025-03-15 00:25:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19422512] [2025-03-15 00:25:38,163 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:25:38,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:38,170 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:25:38,170 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:38,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:38,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19422512] [2025-03-15 00:25:38,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19422512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:38,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:38,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:38,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131394191] [2025-03-15 00:25:38,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:38,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:38,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:38,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:38,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:38,358 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:25:38,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 3385 transitions, 97062 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:38,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:38,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:25:38,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:42,568 INFO L124 PetriNetUnfolderBase]: 4074/9118 cut-off events. [2025-03-15 00:25:42,569 INFO L125 PetriNetUnfolderBase]: For 74769/74903 co-relation queries the response was YES. [2025-03-15 00:25:42,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118835 conditions, 9118 events. 4074/9118 cut-off events. For 74769/74903 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 76278 event pairs, 203 based on Foata normal form. 3/8819 useless extension candidates. Maximal degree in co-relation 118707. Up to 5692 conditions per place. [2025-03-15 00:25:42,635 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2129 selfloop transitions, 264 changer transitions 1057/3502 dead transitions. [2025-03-15 00:25:42,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 3502 transitions, 107288 flow [2025-03-15 00:25:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 973 transitions. [2025-03-15 00:25:42,637 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6900709219858157 [2025-03-15 00:25:42,637 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 173 predicate places. [2025-03-15 00:25:42,637 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 3502 transitions, 107288 flow [2025-03-15 00:25:42,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:42,638 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:42,638 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 00:25:42,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:25:42,638 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:42,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1230552445, now seen corresponding path program 3 times [2025-03-15 00:25:42,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:42,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987708270] [2025-03-15 00:25:42,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:25:42,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:42,648 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:25:42,648 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:42,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:42,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987708270] [2025-03-15 00:25:42,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987708270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:42,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:42,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:42,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729699195] [2025-03-15 00:25:42,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:42,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:42,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:42,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:42,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:42,925 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:25:42,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 3502 transitions, 107288 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:42,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:42,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:25:42,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:47,582 INFO L124 PetriNetUnfolderBase]: 4211/9416 cut-off events. [2025-03-15 00:25:47,583 INFO L125 PetriNetUnfolderBase]: For 91140/91288 co-relation queries the response was YES. [2025-03-15 00:25:47,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130164 conditions, 9416 events. 4211/9416 cut-off events. For 91140/91288 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 79226 event pairs, 220 based on Foata normal form. 6/9120 useless extension candidates. Maximal degree in co-relation 130029. Up to 5900 conditions per place. [2025-03-15 00:25:47,648 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 2136 selfloop transitions, 323 changer transitions 1103/3639 dead transitions. [2025-03-15 00:25:47,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 3639 transitions, 118588 flow [2025-03-15 00:25:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 998 transitions. [2025-03-15 00:25:47,650 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7078014184397163 [2025-03-15 00:25:47,650 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 187 predicate places. [2025-03-15 00:25:47,650 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 3639 transitions, 118588 flow [2025-03-15 00:25:47,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:47,650 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:47,650 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 00:25:47,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:25:47,651 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:47,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2070583097, now seen corresponding path program 4 times [2025-03-15 00:25:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:47,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442070439] [2025-03-15 00:25:47,651 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:25:47,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:47,659 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:25:47,660 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:47,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442070439] [2025-03-15 00:25:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442070439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:47,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634370677] [2025-03-15 00:25:47,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:47,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:47,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:47,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:47,873 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:25:47,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 3639 transitions, 118588 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:47,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:47,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:25:47,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:52,810 INFO L124 PetriNetUnfolderBase]: 4375/9772 cut-off events. [2025-03-15 00:25:52,810 INFO L125 PetriNetUnfolderBase]: For 109899/110046 co-relation queries the response was YES. [2025-03-15 00:25:52,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142817 conditions, 9772 events. 4375/9772 cut-off events. For 109899/110046 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 82664 event pairs, 241 based on Foata normal form. 6/9475 useless extension candidates. Maximal degree in co-relation 142675. Up to 6150 conditions per place. [2025-03-15 00:25:52,992 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 2238 selfloop transitions, 359 changer transitions 1155/3829 dead transitions. [2025-03-15 00:25:52,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 3829 transitions, 132312 flow [2025-03-15 00:25:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 999 transitions. [2025-03-15 00:25:52,993 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7085106382978723 [2025-03-15 00:25:52,994 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 201 predicate places. [2025-03-15 00:25:52,994 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 3829 transitions, 132312 flow [2025-03-15 00:25:52,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:52,994 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:52,994 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 00:25:52,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:25:52,994 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:52,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1664127801, now seen corresponding path program 5 times [2025-03-15 00:25:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15293437] [2025-03-15 00:25:52,995 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:25:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:53,005 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:53,005 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:53,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:53,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15293437] [2025-03-15 00:25:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15293437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:53,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511493511] [2025-03-15 00:25:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:53,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:53,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:53,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:53,299 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:25:53,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 3829 transitions, 132312 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:53,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:53,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:25:53,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:59,156 INFO L124 PetriNetUnfolderBase]: 4462/9960 cut-off events. [2025-03-15 00:25:59,156 INFO L125 PetriNetUnfolderBase]: For 130649/130804 co-relation queries the response was YES. [2025-03-15 00:25:59,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153417 conditions, 9960 events. 4462/9960 cut-off events. For 130649/130804 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 84553 event pairs, 255 based on Foata normal form. 6/9674 useless extension candidates. Maximal degree in co-relation 153268. Up to 6274 conditions per place. [2025-03-15 00:25:59,245 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 2284 selfloop transitions, 371 changer transitions 1204/3936 dead transitions. [2025-03-15 00:25:59,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 3936 transitions, 143682 flow [2025-03-15 00:25:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:25:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:25:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 997 transitions. [2025-03-15 00:25:59,247 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7070921985815602 [2025-03-15 00:25:59,247 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 215 predicate places. [2025-03-15 00:25:59,247 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 3936 transitions, 143682 flow [2025-03-15 00:25:59,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:59,248 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:59,248 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 00:25:59,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:25:59,248 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:59,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1852643823, now seen corresponding path program 7 times [2025-03-15 00:25:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:59,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134012928] [2025-03-15 00:25:59,248 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:25:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:59,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134012928] [2025-03-15 00:25:59,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134012928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:59,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:25:59,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472993374] [2025-03-15 00:25:59,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:59,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:25:59,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:59,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:25:59,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:25:59,427 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:25:59,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 3936 transitions, 143682 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:59,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:59,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:25:59,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:05,333 INFO L124 PetriNetUnfolderBase]: 4436/9908 cut-off events. [2025-03-15 00:26:05,333 INFO L125 PetriNetUnfolderBase]: For 144597/144760 co-relation queries the response was YES. [2025-03-15 00:26:05,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161034 conditions, 9908 events. 4436/9908 cut-off events. For 144597/144760 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 84012 event pairs, 252 based on Foata normal form. 3/9649 useless extension candidates. Maximal degree in co-relation 160878. Up to 6226 conditions per place. [2025-03-15 00:26:05,410 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2538 selfloop transitions, 193 changer transitions 1241/4024 dead transitions. [2025-03-15 00:26:05,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 4024 transitions, 154860 flow [2025-03-15 00:26:05,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:26:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:26:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 946 transitions. [2025-03-15 00:26:05,412 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6709219858156028 [2025-03-15 00:26:05,412 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 229 predicate places. [2025-03-15 00:26:05,412 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 4024 transitions, 154860 flow [2025-03-15 00:26:05,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:05,412 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:05,412 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 00:26:05,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:26:05,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:05,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash -715913341, now seen corresponding path program 2 times [2025-03-15 00:26:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583244033] [2025-03-15 00:26:05,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:26:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:05,421 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:26:05,421 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:26:05,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583244033] [2025-03-15 00:26:05,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583244033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:05,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:05,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:26:05,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523989269] [2025-03-15 00:26:05,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:05,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:26:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:05,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:26:05,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:26:05,590 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:26:05,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 4024 transitions, 154860 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:05,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:05,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:26:05,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:11,999 INFO L124 PetriNetUnfolderBase]: 4521/10096 cut-off events. [2025-03-15 00:26:12,000 INFO L125 PetriNetUnfolderBase]: For 166308/166485 co-relation queries the response was YES. [2025-03-15 00:26:12,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172372 conditions, 10096 events. 4521/10096 cut-off events. For 166308/166485 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 85768 event pairs, 241 based on Foata normal form. 3/9838 useless extension candidates. Maximal degree in co-relation 172209. Up to 6367 conditions per place. [2025-03-15 00:26:12,089 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 2529 selfloop transitions, 329 changer transitions 1277/4212 dead transitions. [2025-03-15 00:26:12,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 4212 transitions, 170476 flow [2025-03-15 00:26:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:26:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:26:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 966 transitions. [2025-03-15 00:26:12,090 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6851063829787234 [2025-03-15 00:26:12,090 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 243 predicate places. [2025-03-15 00:26:12,091 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 4212 transitions, 170476 flow [2025-03-15 00:26:12,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:12,091 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:12,091 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 00:26:12,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:26:12,091 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:12,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash -793929683, now seen corresponding path program 6 times [2025-03-15 00:26:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53137878] [2025-03-15 00:26:12,092 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:26:12,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:12,098 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:26:12,098 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:26:12,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:12,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53137878] [2025-03-15 00:26:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53137878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:12,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:26:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729280128] [2025-03-15 00:26:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:12,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:26:12,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:12,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:26:12,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:26:12,302 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:26:12,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 4212 transitions, 170476 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:12,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:12,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:26:12,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:18,763 INFO L124 PetriNetUnfolderBase]: 4511/10081 cut-off events. [2025-03-15 00:26:18,763 INFO L125 PetriNetUnfolderBase]: For 187029/187220 co-relation queries the response was YES. [2025-03-15 00:26:18,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179959 conditions, 10081 events. 4511/10081 cut-off events. For 187029/187220 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 85718 event pairs, 238 based on Foata normal form. 3/9837 useless extension candidates. Maximal degree in co-relation 179789. Up to 6351 conditions per place. [2025-03-15 00:26:18,987 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 2507 selfloop transitions, 379 changer transitions 1296/4259 dead transitions. [2025-03-15 00:26:18,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 4259 transitions, 180692 flow [2025-03-15 00:26:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:26:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:26:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 964 transitions. [2025-03-15 00:26:18,988 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6836879432624113 [2025-03-15 00:26:18,988 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 257 predicate places. [2025-03-15 00:26:18,989 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 4259 transitions, 180692 flow [2025-03-15 00:26:18,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:18,989 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:18,989 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 00:26:18,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 00:26:18,989 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:18,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:18,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1195808515, now seen corresponding path program 3 times [2025-03-15 00:26:18,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:18,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704279836] [2025-03-15 00:26:18,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:26:18,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:18,996 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:26:18,997 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:26:19,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:19,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704279836] [2025-03-15 00:26:19,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704279836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:19,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:19,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:26:19,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002496212] [2025-03-15 00:26:19,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:19,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:26:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:19,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:26:19,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:26:19,160 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:26:19,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 4259 transitions, 180692 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:19,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:19,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:26:19,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:27,091 INFO L124 PetriNetUnfolderBase]: 4619/10322 cut-off events. [2025-03-15 00:26:27,091 INFO L125 PetriNetUnfolderBase]: For 202823/203030 co-relation queries the response was YES. [2025-03-15 00:26:27,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193165 conditions, 10322 events. 4619/10322 cut-off events. For 202823/203030 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 88110 event pairs, 239 based on Foata normal form. 3/10078 useless extension candidates. Maximal degree in co-relation 192988. Up to 6532 conditions per place. [2025-03-15 00:26:27,188 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2785 selfloop transitions, 235 changer transitions 1352/4434 dead transitions. [2025-03-15 00:26:27,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 4434 transitions, 196974 flow [2025-03-15 00:26:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:26:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:26:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 942 transitions. [2025-03-15 00:26:27,190 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6680851063829787 [2025-03-15 00:26:27,190 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 271 predicate places. [2025-03-15 00:26:27,190 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 4434 transitions, 196974 flow [2025-03-15 00:26:27,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:27,190 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:27,190 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 00:26:27,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:26:27,190 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:27,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:27,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1650988665, now seen corresponding path program 4 times [2025-03-15 00:26:27,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:27,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365919562] [2025-03-15 00:26:27,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:26:27,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:27,198 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:26:27,198 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:26:27,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:27,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365919562] [2025-03-15 00:26:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365919562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:26:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142581538] [2025-03-15 00:26:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:27,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:26:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:27,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:26:27,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:26:27,370 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:26:27,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 4434 transitions, 196974 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:27,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:27,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:26:27,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:35,167 INFO L124 PetriNetUnfolderBase]: 4661/10428 cut-off events. [2025-03-15 00:26:35,167 INFO L125 PetriNetUnfolderBase]: For 220252/220475 co-relation queries the response was YES. [2025-03-15 00:26:35,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203565 conditions, 10428 events. 4661/10428 cut-off events. For 220252/220475 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 89250 event pairs, 235 based on Foata normal form. 3/10184 useless extension candidates. Maximal degree in co-relation 203381. Up to 6577 conditions per place. [2025-03-15 00:26:35,283 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2576 selfloop transitions, 483 changer transitions 1447/4568 dead transitions. [2025-03-15 00:26:35,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 4568 transitions, 211600 flow [2025-03-15 00:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:26:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:26:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 880 transitions. [2025-03-15 00:26:35,284 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.668693009118541 [2025-03-15 00:26:35,284 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 284 predicate places. [2025-03-15 00:26:35,284 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 4568 transitions, 211600 flow [2025-03-15 00:26:35,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:35,285 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:35,285 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 00:26:35,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 00:26:35,285 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:35,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:35,285 INFO L85 PathProgramCache]: Analyzing trace with hash 798013059, now seen corresponding path program 3 times [2025-03-15 00:26:35,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:35,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73678955] [2025-03-15 00:26:35,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:26:35,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:35,293 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:26:35,294 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:26:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73678955] [2025-03-15 00:26:35,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73678955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:35,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:35,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:26:35,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883467865] [2025-03-15 00:26:35,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:35,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:26:35,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:35,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:26:35,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:26:35,607 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:26:35,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 4568 transitions, 211600 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:35,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:35,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:26:35,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:44,220 INFO L124 PetriNetUnfolderBase]: 4753/10649 cut-off events. [2025-03-15 00:26:44,220 INFO L125 PetriNetUnfolderBase]: For 252779/253018 co-relation queries the response was YES. [2025-03-15 00:26:44,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215784 conditions, 10649 events. 4753/10649 cut-off events. For 252779/253018 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 91573 event pairs, 235 based on Foata normal form. 5/10407 useless extension candidates. Maximal degree in co-relation 215593. Up to 6676 conditions per place. [2025-03-15 00:26:44,337 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 2594 selfloop transitions, 531 changer transitions 1497/4699 dead transitions. [2025-03-15 00:26:44,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 4699 transitions, 226752 flow [2025-03-15 00:26:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:26:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:26:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 901 transitions. [2025-03-15 00:26:44,338 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6846504559270516 [2025-03-15 00:26:44,339 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 297 predicate places. [2025-03-15 00:26:44,339 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 4699 transitions, 226752 flow [2025-03-15 00:26:44,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:44,339 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:44,339 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 00:26:44,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 00:26:44,339 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:44,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash -237548995, now seen corresponding path program 5 times [2025-03-15 00:26:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370778991] [2025-03-15 00:26:44,340 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:26:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:44,347 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:26:44,348 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:26:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370778991] [2025-03-15 00:26:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370778991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:44,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:26:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416782913] [2025-03-15 00:26:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:26:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:44,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:26:44,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:26:44,510 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:26:44,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 4699 transitions, 226752 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:44,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:44,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:26:44,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:55,108 INFO L124 PetriNetUnfolderBase]: 4849/10879 cut-off events. [2025-03-15 00:26:55,109 INFO L125 PetriNetUnfolderBase]: For 269194/269444 co-relation queries the response was YES. [2025-03-15 00:26:55,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228697 conditions, 10879 events. 4849/10879 cut-off events. For 269194/269444 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 94136 event pairs, 240 based on Foata normal form. 4/10636 useless extension candidates. Maximal degree in co-relation 228499. Up to 6810 conditions per place. [2025-03-15 00:26:55,230 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2674 selfloop transitions, 506 changer transitions 1582/4824 dead transitions. [2025-03-15 00:26:55,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 4824 transitions, 242244 flow [2025-03-15 00:26:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:26:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:26:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 940 transitions. [2025-03-15 00:26:55,231 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-15 00:26:55,231 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 311 predicate places. [2025-03-15 00:26:55,231 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 4824 transitions, 242244 flow [2025-03-15 00:26:55,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:55,232 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:55,232 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 00:26:55,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 00:26:55,232 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:55,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2044862019, now seen corresponding path program 6 times [2025-03-15 00:26:55,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:55,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436468691] [2025-03-15 00:26:55,232 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:26:55,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:55,240 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:26:55,240 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:26:55,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:55,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436468691] [2025-03-15 00:26:55,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436468691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:55,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:55,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:26:55,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333127006] [2025-03-15 00:26:55,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:55,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:26:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:55,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:26:55,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:26:55,541 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:26:55,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 4824 transitions, 242244 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:26:55,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:55,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:26:55,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:07,305 INFO L124 PetriNetUnfolderBase]: 4973/11172 cut-off events. [2025-03-15 00:27:07,305 INFO L125 PetriNetUnfolderBase]: For 295957/296225 co-relation queries the response was YES. [2025-03-15 00:27:07,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243576 conditions, 11172 events. 4973/11172 cut-off events. For 295957/296225 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 97201 event pairs, 240 based on Foata normal form. 4/10928 useless extension candidates. Maximal degree in co-relation 243371. Up to 7008 conditions per place. [2025-03-15 00:27:07,430 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2777 selfloop transitions, 489 changer transitions 1670/4998 dead transitions. [2025-03-15 00:27:07,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 4998 transitions, 260858 flow [2025-03-15 00:27:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:27:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:27:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 940 transitions. [2025-03-15 00:27:07,432 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-15 00:27:07,432 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 325 predicate places. [2025-03-15 00:27:07,432 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 4998 transitions, 260858 flow [2025-03-15 00:27:07,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:27:07,432 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:07,433 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:27:07,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 00:27:07,433 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:27:07,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1710882405, now seen corresponding path program 7 times [2025-03-15 00:27:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:07,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107231644] [2025-03-15 00:27:07,433 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:27:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:27:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:27:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:07,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107231644] [2025-03-15 00:27:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107231644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:07,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:27:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128191044] [2025-03-15 00:27:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:07,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:27:07,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:07,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:27:07,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:27:07,651 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:27:07,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 4998 transitions, 260858 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:27:07,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:07,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:27:07,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:20,213 INFO L124 PetriNetUnfolderBase]: 5003/11271 cut-off events. [2025-03-15 00:27:20,214 INFO L125 PetriNetUnfolderBase]: For 314716/315002 co-relation queries the response was YES. [2025-03-15 00:27:20,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253685 conditions, 11271 events. 5003/11271 cut-off events. For 314716/315002 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 98387 event pairs, 244 based on Foata normal form. 4/11052 useless extension candidates. Maximal degree in co-relation 253473. Up to 7021 conditions per place. [2025-03-15 00:27:20,350 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2839 selfloop transitions, 466 changer transitions 1747/5114 dead transitions. [2025-03-15 00:27:20,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 5114 transitions, 276928 flow [2025-03-15 00:27:20,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:27:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:27:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 937 transitions. [2025-03-15 00:27:20,351 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6645390070921986 [2025-03-15 00:27:20,351 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 339 predicate places. [2025-03-15 00:27:20,351 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 5114 transitions, 276928 flow [2025-03-15 00:27:20,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:27:20,352 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:20,352 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 00:27:20,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 00:27:20,352 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:27:20,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:20,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1784776545, now seen corresponding path program 4 times [2025-03-15 00:27:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:20,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481924526] [2025-03-15 00:27:20,352 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:27:20,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:20,359 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:27:20,359 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:27:20,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:20,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481924526] [2025-03-15 00:27:20,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481924526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:20,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:20,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:27:20,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135803696] [2025-03-15 00:27:20,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:20,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:27:20,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:20,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:27:20,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:27:20,676 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:27:20,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 5114 transitions, 276928 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:27:20,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:20,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:27:20,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:32,572 INFO L124 PetriNetUnfolderBase]: 5138/11562 cut-off events. [2025-03-15 00:27:32,573 INFO L125 PetriNetUnfolderBase]: For 353871/354175 co-relation queries the response was YES. [2025-03-15 00:27:32,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269421 conditions, 11562 events. 5138/11562 cut-off events. For 353871/354175 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 101430 event pairs, 261 based on Foata normal form. 7/11346 useless extension candidates. Maximal degree in co-relation 269202. Up to 7250 conditions per place. [2025-03-15 00:27:32,717 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 2821 selfloop transitions, 563 changer transitions 1795/5262 dead transitions. [2025-03-15 00:27:32,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 5262 transitions, 295310 flow [2025-03-15 00:27:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:27:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:27:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 963 transitions. [2025-03-15 00:27:32,719 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6829787234042554 [2025-03-15 00:27:32,719 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 353 predicate places. [2025-03-15 00:27:32,719 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 5262 transitions, 295310 flow [2025-03-15 00:27:32,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:27:32,720 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:32,720 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 00:27:32,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 00:27:32,720 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:27:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 176018507, now seen corresponding path program 5 times [2025-03-15 00:27:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504213341] [2025-03-15 00:27:32,720 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:27:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:32,727 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:27:32,727 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:27:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504213341] [2025-03-15 00:27:33,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504213341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:33,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:33,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:27:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804400106] [2025-03-15 00:27:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:33,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:27:33,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:33,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:27:33,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:27:33,021 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:27:33,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 5262 transitions, 295310 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:27:33,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:33,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:27:33,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:47,771 INFO L124 PetriNetUnfolderBase]: 5296/11905 cut-off events. [2025-03-15 00:27:47,772 INFO L125 PetriNetUnfolderBase]: For 404215/404522 co-relation queries the response was YES. [2025-03-15 00:27:47,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287028 conditions, 11905 events. 5296/11905 cut-off events. For 404215/404522 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 104870 event pairs, 274 based on Foata normal form. 7/11688 useless extension candidates. Maximal degree in co-relation 286802. Up to 7526 conditions per place. [2025-03-15 00:27:47,911 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 2952 selfloop transitions, 569 changer transitions 1845/5449 dead transitions. [2025-03-15 00:27:47,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 5449 transitions, 316604 flow [2025-03-15 00:27:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:27:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:27:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 964 transitions. [2025-03-15 00:27:47,913 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6836879432624113 [2025-03-15 00:27:47,914 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 367 predicate places. [2025-03-15 00:27:47,914 INFO L471 AbstractCegarLoop]: Abstraction has has 465 places, 5449 transitions, 316604 flow [2025-03-15 00:27:47,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:27:47,914 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:47,914 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 00:27:47,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 00:27:47,914 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:27:47,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:47,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1683911225, now seen corresponding path program 6 times [2025-03-15 00:27:47,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:47,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955940148] [2025-03-15 00:27:47,915 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:27:47,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:47,923 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:27:47,923 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:27:48,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955940148] [2025-03-15 00:27:48,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955940148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:48,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:48,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:27:48,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783814520] [2025-03-15 00:27:48,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:48,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:27:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:48,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:27:48,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:27:48,129 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:27:48,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 5449 transitions, 316604 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:27:48,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:48,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:27:48,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:28:04,758 INFO L124 PetriNetUnfolderBase]: 5386/12107 cut-off events. [2025-03-15 00:28:04,758 INFO L125 PetriNetUnfolderBase]: For 449808/450127 co-relation queries the response was YES. [2025-03-15 00:28:04,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301002 conditions, 12107 events. 5386/12107 cut-off events. For 449808/450127 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 106990 event pairs, 293 based on Foata normal form. 7/11901 useless extension candidates. Maximal degree in co-relation 300769. Up to 7671 conditions per place. [2025-03-15 00:28:04,907 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 3034 selfloop transitions, 552 changer transitions 1896/5565 dead transitions. [2025-03-15 00:28:04,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 5565 transitions, 334272 flow [2025-03-15 00:28:04,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:28:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:28:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 962 transitions. [2025-03-15 00:28:04,909 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6822695035460993 [2025-03-15 00:28:04,909 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 381 predicate places. [2025-03-15 00:28:04,909 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 5565 transitions, 334272 flow [2025-03-15 00:28:04,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:28:04,909 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:28:04,910 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 00:28:04,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 00:28:04,910 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:28:04,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:28:04,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1107527485, now seen corresponding path program 8 times [2025-03-15 00:28:04,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:28:04,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612720638] [2025-03-15 00:28:04,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:28:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:28:04,918 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:28:04,918 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:28:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:28:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:28:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612720638] [2025-03-15 00:28:05,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612720638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:28:05,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:28:05,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:28:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128156690] [2025-03-15 00:28:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:28:05,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:28:05,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:28:05,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:28:05,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:28:05,091 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:28:05,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 5565 transitions, 334272 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:28:05,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:28:05,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:28:05,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:28:22,292 INFO L124 PetriNetUnfolderBase]: 5440/12237 cut-off events. [2025-03-15 00:28:22,292 INFO L125 PetriNetUnfolderBase]: For 478402/478733 co-relation queries the response was YES. [2025-03-15 00:28:22,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313811 conditions, 12237 events. 5440/12237 cut-off events. For 478402/478733 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 108476 event pairs, 296 based on Foata normal form. 4/12028 useless extension candidates. Maximal degree in co-relation 313571. Up to 7734 conditions per place. [2025-03-15 00:28:22,457 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 2947 selfloop transitions, 711 changer transitions 1978/5694 dead transitions. [2025-03-15 00:28:22,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 5694 transitions, 352868 flow [2025-03-15 00:28:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 00:28:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 00:28:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 734 transitions. [2025-03-15 00:28:22,458 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.650709219858156 [2025-03-15 00:28:22,459 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 392 predicate places. [2025-03-15 00:28:22,459 INFO L471 AbstractCegarLoop]: Abstraction has has 490 places, 5694 transitions, 352868 flow [2025-03-15 00:28:22,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:28:22,459 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:28:22,459 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 00:28:22,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 00:28:22,460 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:28:22,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:28:22,460 INFO L85 PathProgramCache]: Analyzing trace with hash 830495349, now seen corresponding path program 9 times [2025-03-15 00:28:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:28:22,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305119646] [2025-03-15 00:28:22,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:28:22,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:28:22,468 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:28:22,469 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:28:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:28:22,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:28:22,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305119646] [2025-03-15 00:28:22,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305119646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:28:22,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:28:22,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:28:22,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959204248] [2025-03-15 00:28:22,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:28:22,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:28:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:28:22,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:28:22,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:28:22,620 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:28:22,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 5694 transitions, 352868 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:28:22,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:28:22,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:28:22,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:28:42,135 INFO L124 PetriNetUnfolderBase]: 5549/12465 cut-off events. [2025-03-15 00:28:42,135 INFO L125 PetriNetUnfolderBase]: For 513053/513402 co-relation queries the response was YES. [2025-03-15 00:28:42,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331000 conditions, 12465 events. 5549/12465 cut-off events. For 513053/513402 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 110750 event pairs, 301 based on Foata normal form. 4/12253 useless extension candidates. Maximal degree in co-relation 330753. Up to 7899 conditions per place. [2025-03-15 00:28:42,306 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 3512 selfloop transitions, 263 changer transitions 2041/5874 dead transitions. [2025-03-15 00:28:42,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 5874 transitions, 375834 flow [2025-03-15 00:28:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:28:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:28:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 863 transitions. [2025-03-15 00:28:42,307 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6557750759878419 [2025-03-15 00:28:42,307 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 405 predicate places. [2025-03-15 00:28:42,307 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 5874 transitions, 375834 flow [2025-03-15 00:28:42,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:28:42,308 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:28:42,308 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 00:28:42,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 00:28:42,308 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:28:42,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:28:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1738061815, now seen corresponding path program 7 times [2025-03-15 00:28:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:28:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981272777] [2025-03-15 00:28:42,309 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:28:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:28:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:28:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:28:42,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:28:42,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981272777] [2025-03-15 00:28:42,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981272777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:28:42,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:28:42,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:28:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757257844] [2025-03-15 00:28:42,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:28:42,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:28:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:28:42,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:28:42,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:28:42,466 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:28:42,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 5874 transitions, 375834 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:28:42,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:28:42,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:28:42,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:04,221 INFO L124 PetriNetUnfolderBase]: 5535/12451 cut-off events. [2025-03-15 00:29:04,221 INFO L125 PetriNetUnfolderBase]: For 552110/552477 co-relation queries the response was YES. [2025-03-15 00:29:04,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339854 conditions, 12451 events. 5535/12451 cut-off events. For 552110/552477 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 110687 event pairs, 296 based on Foata normal form. 4/12256 useless extension candidates. Maximal degree in co-relation 339600. Up to 7880 conditions per place. [2025-03-15 00:29:04,385 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 3324 selfloop transitions, 453 changer transitions 2067/5927 dead transitions. [2025-03-15 00:29:04,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 5927 transitions, 390876 flow [2025-03-15 00:29:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:29:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:29:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 927 transitions. [2025-03-15 00:29:04,387 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6574468085106383 [2025-03-15 00:29:04,387 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 419 predicate places. [2025-03-15 00:29:04,387 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 5927 transitions, 390876 flow [2025-03-15 00:29:04,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:04,388 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:04,388 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 00:29:04,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 00:29:04,388 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:29:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1816078157, now seen corresponding path program 7 times [2025-03-15 00:29:04,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:04,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036077315] [2025-03-15 00:29:04,388 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:29:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:29:04,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:04,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036077315] [2025-03-15 00:29:04,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036077315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:04,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:04,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:29:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359886605] [2025-03-15 00:29:04,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:04,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:29:04,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:04,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:29:04,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:29:04,613 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:29:04,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 5927 transitions, 390876 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:04,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:04,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:29:04,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:26,057 INFO L124 PetriNetUnfolderBase]: 5634/12659 cut-off events. [2025-03-15 00:29:26,058 INFO L125 PetriNetUnfolderBase]: For 605216/605601 co-relation queries the response was YES. [2025-03-15 00:29:26,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355698 conditions, 12659 events. 5634/12659 cut-off events. For 605216/605601 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 112724 event pairs, 292 based on Foata normal form. 7/12468 useless extension candidates. Maximal degree in co-relation 355437. Up to 8040 conditions per place. [2025-03-15 00:29:26,244 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 3151 selfloop transitions, 732 changer transitions 2117/6083 dead transitions. [2025-03-15 00:29:26,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 6083 transitions, 412928 flow [2025-03-15 00:29:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 00:29:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 00:29:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 755 transitions. [2025-03-15 00:29:26,245 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6693262411347518 [2025-03-15 00:29:26,246 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 430 predicate places. [2025-03-15 00:29:26,246 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 6083 transitions, 412928 flow [2025-03-15 00:29:26,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:26,246 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:26,246 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 00:29:26,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 00:29:26,246 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:29:26,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1749162641, now seen corresponding path program 8 times [2025-03-15 00:29:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659858857] [2025-03-15 00:29:26,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:29:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:26,255 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:29:26,255 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:29:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659858857] [2025-03-15 00:29:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659858857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:29:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945517523] [2025-03-15 00:29:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:29:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:26,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:29:26,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:29:26,625 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:29:26,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 6083 transitions, 412928 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:26,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:26,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:29:26,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:51,944 INFO L124 PetriNetUnfolderBase]: 5724/12865 cut-off events. [2025-03-15 00:29:51,945 INFO L125 PetriNetUnfolderBase]: For 657252/657604 co-relation queries the response was YES. [2025-03-15 00:29:51,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371475 conditions, 12865 events. 5724/12865 cut-off events. For 657252/657604 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 114877 event pairs, 297 based on Foata normal form. 6/12673 useless extension candidates. Maximal degree in co-relation 371207. Up to 8191 conditions per place. [2025-03-15 00:29:52,121 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 3514 selfloop transitions, 491 changer transitions 2145/6233 dead transitions. [2025-03-15 00:29:52,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 6233 transitions, 435540 flow [2025-03-15 00:29:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:29:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:29:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 880 transitions. [2025-03-15 00:29:52,122 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.668693009118541 [2025-03-15 00:29:52,122 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 443 predicate places. [2025-03-15 00:29:52,122 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 6233 transitions, 435540 flow [2025-03-15 00:29:52,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:52,123 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:52,123 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 00:29:52,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 00:29:52,123 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:29:52,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1914704789, now seen corresponding path program 10 times [2025-03-15 00:29:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:52,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881275097] [2025-03-15 00:29:52,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:29:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:52,132 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:29:52,139 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:29:52,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:52,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881275097] [2025-03-15 00:29:52,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881275097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:52,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:52,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:29:52,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205579365] [2025-03-15 00:29:52,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:52,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:29:52,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:52,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:29:52,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:29:52,309 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:29:52,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 6233 transitions, 435540 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:52,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:52,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:29:52,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:21,256 INFO L124 PetriNetUnfolderBase]: 5804/13054 cut-off events. [2025-03-15 00:30:21,256 INFO L125 PetriNetUnfolderBase]: For 701206/701576 co-relation queries the response was YES. [2025-03-15 00:30:21,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387311 conditions, 13054 events. 5804/13054 cut-off events. For 701206/701576 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 116919 event pairs, 296 based on Foata normal form. 5/12861 useless extension candidates. Maximal degree in co-relation 387036. Up to 8303 conditions per place. [2025-03-15 00:30:21,440 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 3759 selfloop transitions, 294 changer transitions 2233/6344 dead transitions. [2025-03-15 00:30:21,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 6344 transitions, 455538 flow [2025-03-15 00:30:21,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 821 transitions. [2025-03-15 00:30:21,441 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6718494271685761 [2025-03-15 00:30:21,442 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 455 predicate places. [2025-03-15 00:30:21,442 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 6344 transitions, 455538 flow [2025-03-15 00:30:21,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:21,442 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:21,442 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 00:30:21,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 00:30:21,442 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:30:21,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:21,443 INFO L85 PathProgramCache]: Analyzing trace with hash -621507813, now seen corresponding path program 11 times [2025-03-15 00:30:21,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:21,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546466055] [2025-03-15 00:30:21,443 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:30:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:21,452 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:30:21,452 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:30:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546466055] [2025-03-15 00:30:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546466055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:21,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:30:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109343083] [2025-03-15 00:30:21,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:21,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:21,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:21,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:21,604 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:30:21,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 6344 transitions, 455538 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:21,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:21,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:30:21,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:51,144 INFO L124 PetriNetUnfolderBase]: 5896/13274 cut-off events. [2025-03-15 00:30:51,145 INFO L125 PetriNetUnfolderBase]: For 753530/753922 co-relation queries the response was YES. [2025-03-15 00:30:51,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404137 conditions, 13274 events. 5896/13274 cut-off events. For 753530/753922 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 119290 event pairs, 295 based on Foata normal form. 5/13081 useless extension candidates. Maximal degree in co-relation 403855. Up to 8437 conditions per place. [2025-03-15 00:30:51,338 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 3788 selfloop transitions, 305 changer transitions 2318/6469 dead transitions. [2025-03-15 00:30:51,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 6469 transitions, 477284 flow [2025-03-15 00:30:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:30:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:30:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 881 transitions. [2025-03-15 00:30:51,339 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6694528875379939 [2025-03-15 00:30:51,339 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 468 predicate places. [2025-03-15 00:30:51,339 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 6469 transitions, 477284 flow [2025-03-15 00:30:51,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:51,340 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:51,340 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 00:30:51,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 00:30:51,340 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:30:51,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash 552795895, now seen corresponding path program 12 times [2025-03-15 00:30:51,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:51,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401895843] [2025-03-15 00:30:51,340 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:30:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:51,348 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:30:51,348 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:30:51,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:51,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401895843] [2025-03-15 00:30:51,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401895843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:51,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:51,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:30:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791270239] [2025-03-15 00:30:51,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:51,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:51,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:51,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:51,500 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:30:51,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 6469 transitions, 477284 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:51,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:51,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:30:51,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:21,824 INFO L124 PetriNetUnfolderBase]: 6021/13563 cut-off events. [2025-03-15 00:31:21,824 INFO L125 PetriNetUnfolderBase]: For 803578/803992 co-relation queries the response was YES. [2025-03-15 00:31:21,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423685 conditions, 13563 events. 6021/13563 cut-off events. For 803578/803992 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 122402 event pairs, 297 based on Foata normal form. 5/13369 useless extension candidates. Maximal degree in co-relation 423396. Up to 8621 conditions per place. [2025-03-15 00:31:22,023 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 3856 selfloop transitions, 323 changer transitions 2405/6642 dead transitions. [2025-03-15 00:31:22,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 6642 transitions, 503258 flow [2025-03-15 00:31:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:31:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:31:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 883 transitions. [2025-03-15 00:31:22,025 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6709726443768997 [2025-03-15 00:31:22,025 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 481 predicate places. [2025-03-15 00:31:22,025 INFO L471 AbstractCegarLoop]: Abstraction has has 579 places, 6642 transitions, 503258 flow [2025-03-15 00:31:22,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:22,026 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:22,026 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 00:31:22,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-15 00:31:22,026 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:31:22,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1895931847, now seen corresponding path program 13 times [2025-03-15 00:31:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851435003] [2025-03-15 00:31:22,027 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:31:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:31:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:31:22,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:22,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851435003] [2025-03-15 00:31:22,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851435003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:22,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:22,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:31:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470495022] [2025-03-15 00:31:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:22,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:22,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:22,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:22,187 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2025-03-15 00:31:22,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 6642 transitions, 503258 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:22,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:22,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2025-03-15 00:31:22,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:55,621 INFO L124 PetriNetUnfolderBase]: 6172/13913 cut-off events. [2025-03-15 00:31:55,621 INFO L125 PetriNetUnfolderBase]: For 851926/852362 co-relation queries the response was YES. [2025-03-15 00:31:55,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445134 conditions, 13913 events. 6172/13913 cut-off events. For 851926/852362 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 126238 event pairs, 308 based on Foata normal form. 5/13718 useless extension candidates. Maximal degree in co-relation 444838. Up to 8840 conditions per place. [2025-03-15 00:31:55,845 INFO L140 encePairwiseOnDemand]: 69/94 looper letters, 3955 selfloop transitions, 341 changer transitions 2491/6845 dead transitions. [2025-03-15 00:31:55,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 6845 transitions, 532324 flow [2025-03-15 00:31:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:31:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:31:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 882 transitions. [2025-03-15 00:31:55,847 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6702127659574468 [2025-03-15 00:31:55,847 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 494 predicate places. [2025-03-15 00:31:55,847 INFO L471 AbstractCegarLoop]: Abstraction has has 592 places, 6845 transitions, 532324 flow [2025-03-15 00:31:55,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:55,847 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:55,848 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 00:31:55,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-15 00:31:55,848 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:31:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash 701060019, now seen corresponding path program 9 times [2025-03-15 00:31:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:55,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043640863] [2025-03-15 00:31:55,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:31:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:55,857 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:31:55,857 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:31:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043640863] [2025-03-15 00:31:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043640863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:56,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:31:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404920603] [2025-03-15 00:31:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:56,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:56,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:56,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:56,048 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:31:56,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 6845 transitions, 532324 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:56,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:56,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:31:56,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:34,839 INFO L124 PetriNetUnfolderBase]: 6363/14341 cut-off events. [2025-03-15 00:32:34,839 INFO L125 PetriNetUnfolderBase]: For 953880/954338 co-relation queries the response was YES. [2025-03-15 00:32:34,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469982 conditions, 14341 events. 6363/14341 cut-off events. For 953880/954338 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 130756 event pairs, 324 based on Foata normal form. 8/14149 useless extension candidates. Maximal degree in co-relation 469679. Up to 9168 conditions per place. [2025-03-15 00:32:35,066 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 3902 selfloop transitions, 521 changer transitions 2540/7052 dead transitions. [2025-03-15 00:32:35,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 7052 transitions, 562414 flow [2025-03-15 00:32:35,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:32:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:32:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 845 transitions. [2025-03-15 00:32:35,068 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6914893617021277 [2025-03-15 00:32:35,068 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 506 predicate places. [2025-03-15 00:32:35,068 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 7052 transitions, 562414 flow [2025-03-15 00:32:35,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:35,069 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:35,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] [2025-03-15 00:32:35,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-15 00:32:35,069 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:32:35,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash 582894205, now seen corresponding path program 10 times [2025-03-15 00:32:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901979959] [2025-03-15 00:32:35,069 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:32:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:35,077 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:32:35,077 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:32:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:32:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:35,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901979959] [2025-03-15 00:32:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901979959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:35,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:32:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100245015] [2025-03-15 00:32:35,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:35,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:32:35,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:35,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:32:35,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:32:35,260 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:32:35,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 7052 transitions, 562414 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:35,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:35,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:32:35,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:16,411 INFO L124 PetriNetUnfolderBase]: 6496/14625 cut-off events. [2025-03-15 00:33:16,411 INFO L125 PetriNetUnfolderBase]: For 1038689/1039151 co-relation queries the response was YES. [2025-03-15 00:33:16,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491185 conditions, 14625 events. 6496/14625 cut-off events. For 1038689/1039151 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 133709 event pairs, 338 based on Foata normal form. 8/14433 useless extension candidates. Maximal degree in co-relation 490875. Up to 9413 conditions per place. [2025-03-15 00:33:16,640 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 3973 selfloop transitions, 550 changer transitions 2588/7200 dead transitions. [2025-03-15 00:33:16,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 7200 transitions, 588468 flow [2025-03-15 00:33:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:33:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:33:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 907 transitions. [2025-03-15 00:33:16,642 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.689209726443769 [2025-03-15 00:33:16,642 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 519 predicate places. [2025-03-15 00:33:16,642 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 7200 transitions, 588468 flow [2025-03-15 00:33:16,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:16,643 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:16,643 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 00:33:16,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-15 00:33:16,643 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:33:16,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1793828847, now seen corresponding path program 11 times [2025-03-15 00:33:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:16,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529782256] [2025-03-15 00:33:16,643 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:33:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:16,651 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:33:16,652 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:33:16,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:33:16,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529782256] [2025-03-15 00:33:16,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529782256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:33:16,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:33:16,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:33:16,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276814238] [2025-03-15 00:33:16,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:33:16,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:33:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:33:16,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:33:16,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:33:16,831 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:33:16,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 7200 transitions, 588468 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:16,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:33:16,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:33:16,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:01,419 INFO L124 PetriNetUnfolderBase]: 6658/14966 cut-off events. [2025-03-15 00:34:01,419 INFO L125 PetriNetUnfolderBase]: For 1123177/1123655 co-relation queries the response was YES. [2025-03-15 00:34:01,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514911 conditions, 14966 events. 6658/14966 cut-off events. For 1123177/1123655 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 137291 event pairs, 357 based on Foata normal form. 8/14773 useless extension candidates. Maximal degree in co-relation 514594. Up to 9696 conditions per place. [2025-03-15 00:34:01,668 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 4069 selfloop transitions, 591 changer transitions 2637/7386 dead transitions. [2025-03-15 00:34:01,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 7386 transitions, 618370 flow [2025-03-15 00:34:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:34:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:34:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 909 transitions. [2025-03-15 00:34:01,669 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6907294832826748 [2025-03-15 00:34:01,670 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 532 predicate places. [2025-03-15 00:34:01,670 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 7386 transitions, 618370 flow [2025-03-15 00:34:01,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:01,670 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:01,670 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 00:34:01,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-15 00:34:01,670 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:34:01,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1233572449, now seen corresponding path program 12 times [2025-03-15 00:34:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:01,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757363364] [2025-03-15 00:34:01,671 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:34:01,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:01,679 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:34:01,679 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:34:01,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757363364] [2025-03-15 00:34:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757363364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:01,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:01,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:34:01,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165706177] [2025-03-15 00:34:01,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:01,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:34:01,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:01,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:34:01,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:34:01,857 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:34:01,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 7386 transitions, 618370 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:01,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:01,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:34:01,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:50,381 INFO L124 PetriNetUnfolderBase]: 6803/15282 cut-off events. [2025-03-15 00:34:50,381 INFO L125 PetriNetUnfolderBase]: For 1218750/1219244 co-relation queries the response was YES. [2025-03-15 00:34:50,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537745 conditions, 15282 events. 6803/15282 cut-off events. For 1218750/1219244 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 140795 event pairs, 375 based on Foata normal form. 8/15088 useless extension candidates. Maximal degree in co-relation 537421. Up to 9942 conditions per place. [2025-03-15 00:34:50,642 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 4158 selfloop transitions, 615 changer transitions 2686/7548 dead transitions. [2025-03-15 00:34:50,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 7548 transitions, 646924 flow [2025-03-15 00:34:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:34:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:34:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 908 transitions. [2025-03-15 00:34:50,643 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6899696048632219 [2025-03-15 00:34:50,644 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 545 predicate places. [2025-03-15 00:34:50,644 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 7548 transitions, 646924 flow [2025-03-15 00:34:50,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:50,644 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:50,644 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 00:34:50,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-15 00:34:50,644 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:34:50,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:50,645 INFO L85 PathProgramCache]: Analyzing trace with hash 39340891, now seen corresponding path program 13 times [2025-03-15 00:34:50,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:50,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704576367] [2025-03-15 00:34:50,645 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:34:50,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:34:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:50,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704576367] [2025-03-15 00:34:50,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704576367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:50,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:50,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:34:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679292015] [2025-03-15 00:34:50,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:50,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:34:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:50,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:34:50,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:34:50,864 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:34:50,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 7548 transitions, 646924 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:50,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:50,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:34:50,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:39,928 INFO L124 PetriNetUnfolderBase]: 7023/15769 cut-off events. [2025-03-15 00:35:39,928 INFO L125 PetriNetUnfolderBase]: For 1343278/1343865 co-relation queries the response was YES. [2025-03-15 00:35:39,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566902 conditions, 15769 events. 7023/15769 cut-off events. For 1343278/1343865 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 145858 event pairs, 399 based on Foata normal form. 11/15576 useless extension candidates. Maximal degree in co-relation 566571. Up to 10311 conditions per place. [2025-03-15 00:35:40,198 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 4133 selfloop transitions, 805 changer transitions 2739/7766 dead transitions. [2025-03-15 00:35:40,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 7766 transitions, 681022 flow [2025-03-15 00:35:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:35:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:35:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 810 transitions. [2025-03-15 00:35:40,199 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.662847790507365 [2025-03-15 00:35:40,199 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 557 predicate places. [2025-03-15 00:35:40,200 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 7766 transitions, 681022 flow [2025-03-15 00:35:40,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:35:40,200 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:40,200 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 00:35:40,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-15 00:35:40,200 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:35:40,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1098877147, now seen corresponding path program 14 times [2025-03-15 00:35:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:40,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178982206] [2025-03-15 00:35:40,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:35:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:40,208 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:35:40,209 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:40,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:40,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178982206] [2025-03-15 00:35:40,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178982206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:40,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:40,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:35:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940258525] [2025-03-15 00:35:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:40,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:35:40,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:40,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:35:40,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:35:40,400 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:35:40,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 7766 transitions, 681022 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:35:40,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:40,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:35:40,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:36,706 INFO L124 PetriNetUnfolderBase]: 7223/16190 cut-off events. [2025-03-15 00:36:36,706 INFO L125 PetriNetUnfolderBase]: For 1473754/1474401 co-relation queries the response was YES. [2025-03-15 00:36:36,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595616 conditions, 16190 events. 7223/16190 cut-off events. For 1473754/1474401 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 150128 event pairs, 415 based on Foata normal form. 11/15995 useless extension candidates. Maximal degree in co-relation 595278. Up to 10657 conditions per place. [2025-03-15 00:36:37,013 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 4095 selfloop transitions, 990 changer transitions 2792/7966 dead transitions. [2025-03-15 00:36:37,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 7966 transitions, 714352 flow [2025-03-15 00:36:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:36:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:36:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 822 transitions. [2025-03-15 00:36:37,014 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6726677577741408 [2025-03-15 00:36:37,014 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 569 predicate places. [2025-03-15 00:36:37,015 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 7966 transitions, 714352 flow [2025-03-15 00:36:37,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:36:37,015 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:37,015 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 00:36:37,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-15 00:36:37,015 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:36:37,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash -78824923, now seen corresponding path program 15 times [2025-03-15 00:36:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736439218] [2025-03-15 00:36:37,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:36:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:37,025 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:36:37,025 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:36:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:36:37,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:37,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736439218] [2025-03-15 00:36:37,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736439218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:37,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:37,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:36:37,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439984923] [2025-03-15 00:36:37,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:37,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:36:37,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:37,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:36:37,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:36:37,219 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:36:37,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 7966 transitions, 714352 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:36:37,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:37,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:36:37,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:33,348 INFO L124 PetriNetUnfolderBase]: 7358/16487 cut-off events. [2025-03-15 00:37:33,349 INFO L125 PetriNetUnfolderBase]: For 1595892/1596472 co-relation queries the response was YES. [2025-03-15 00:37:33,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619800 conditions, 16487 events. 7358/16487 cut-off events. For 1595892/1596472 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 153415 event pairs, 429 based on Foata normal form. 11/16293 useless extension candidates. Maximal degree in co-relation 619455. Up to 10895 conditions per place. [2025-03-15 00:37:33,849 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 4304 selfloop transitions, 883 changer transitions 2846/8122 dead transitions. [2025-03-15 00:37:33,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 8122 transitions, 744450 flow [2025-03-15 00:37:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:37:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:37:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 874 transitions. [2025-03-15 00:37:33,850 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6641337386018237 [2025-03-15 00:37:33,851 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 582 predicate places. [2025-03-15 00:37:33,851 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 8122 transitions, 744450 flow [2025-03-15 00:37:33,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:33,851 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:33,851 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 00:37:33,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-15 00:37:33,851 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:37:33,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1839419321, now seen corresponding path program 16 times [2025-03-15 00:37:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223423937] [2025-03-15 00:37:33,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:37:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:33,860 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:37:33,860 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:34,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:34,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223423937] [2025-03-15 00:37:34,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223423937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:34,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:34,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:37:34,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847014855] [2025-03-15 00:37:34,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:34,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:37:34,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:34,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:37:34,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:37:34,037 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:37:34,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 8122 transitions, 744450 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:34,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:34,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:37:34,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:33,022 INFO L124 PetriNetUnfolderBase]: 7531/16882 cut-off events. [2025-03-15 00:38:33,023 INFO L125 PetriNetUnfolderBase]: For 1723081/1723671 co-relation queries the response was YES. [2025-03-15 00:38:33,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646982 conditions, 16882 events. 7531/16882 cut-off events. For 1723081/1723671 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 157830 event pairs, 454 based on Foata normal form. 11/16686 useless extension candidates. Maximal degree in co-relation 646630. Up to 11183 conditions per place. [2025-03-15 00:38:33,329 INFO L140 encePairwiseOnDemand]: 73/94 looper letters, 4394 selfloop transitions, 933 changer transitions 2901/8317 dead transitions. [2025-03-15 00:38:33,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 8317 transitions, 778904 flow [2025-03-15 00:38:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:38:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:38:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 883 transitions. [2025-03-15 00:38:33,330 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6709726443768997 [2025-03-15 00:38:33,331 INFO L298 CegarLoopForPetriNet]: 98 programPoint places, 595 predicate places. [2025-03-15 00:38:33,331 INFO L471 AbstractCegarLoop]: Abstraction has has 693 places, 8317 transitions, 778904 flow [2025-03-15 00:38:33,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:38:33,331 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:33,331 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 00:38:33,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-15 00:38:33,331 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:38:33,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1895291577, now seen corresponding path program 17 times [2025-03-15 00:38:33,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:33,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146199049] [2025-03-15 00:38:33,332 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:38:33,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:33,340 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:38:33,340 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:38:33,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:33,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146199049] [2025-03-15 00:38:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146199049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:38:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:38:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 00:38:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57787660] [2025-03-15 00:38:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:38:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:33,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:38:33,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:38:33,533 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 94 [2025-03-15 00:38:33,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 8317 transitions, 778904 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:38:33,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:33,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 94 [2025-03-15 00:38:33,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 00:39:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:39:02,425 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 00:39:02,428 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-15 00:39:02,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-15 00:39:02,429 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (13states, 46/94 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 304974 conditions, 7061 events (3037/7060 cut-off events. For 547050/547054 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 66080 event pairs, 165 based on Foata normal form. 2/7658 useless extension candidates. Maximal degree in co-relation 304669. Up to 5449 conditions per place.). [2025-03-15 00:39:02,433 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-15 00:39:02,433 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-15 00:39:02,433 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-15 00:39:02,433 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-15 00:39:02,433 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-15 00:39:02,433 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-15 00:39:02,433 INFO L422 BasicCegarLoop]: Path program histogram: [17, 13, 7, 7, 1, 1, 1, 1] [2025-03-15 00:39:02,445 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:39:02,445 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:39:02,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:39:02 BasicIcfg [2025-03-15 00:39:02,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:39:02,460 INFO L158 Benchmark]: Toolchain (without parser) took 839778.68ms. Allocated memory was 71.3MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 42.0MB in the beginning and 658.9MB in the end (delta: -616.9MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2025-03-15 00:39:02,460 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 71.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:39:02,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.02ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 39.4MB in the end (delta: 2.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-03-15 00:39:02,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.19ms. Allocated memory is still 71.3MB. Free memory was 39.4MB in the beginning and 37.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:39:02,461 INFO L158 Benchmark]: Boogie Preprocessor took 26.57ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 35.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:39:02,461 INFO L158 Benchmark]: RCFGBuilder took 331.30ms. Allocated memory is still 71.3MB. Free memory was 35.6MB in the beginning and 20.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 00:39:02,461 INFO L158 Benchmark]: TraceAbstraction took 838876.22ms. Allocated memory was 71.3MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 19.0MB in the beginning and 658.9MB in the end (delta: -639.9MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2025-03-15 00:39:02,462 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.25ms. Allocated memory is still 71.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 507.02ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 39.4MB in the end (delta: 2.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.19ms. Allocated memory is still 71.3MB. Free memory was 39.4MB in the beginning and 37.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.57ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 35.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 331.30ms. Allocated memory is still 71.3MB. Free memory was 35.6MB in the beginning and 20.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 838876.22ms. Allocated memory was 71.3MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 19.0MB in the beginning and 658.9MB in the end (delta: -639.9MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (13states, 46/94 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 304974 conditions, 7061 events (3037/7060 cut-off events. For 547050/547054 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 66080 event pairs, 165 based on Foata normal form. 2/7658 useless extension candidates. Maximal degree in co-relation 304669. Up to 5449 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (13states, 46/94 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 304974 conditions, 7061 events (3037/7060 cut-off events. For 547050/547054 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 66080 event pairs, 165 based on Foata normal form. 2/7658 useless extension candidates. Maximal degree in co-relation 304669. Up to 5449 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (13states, 46/94 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 304974 conditions, 7061 events (3037/7060 cut-off events. For 547050/547054 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 66080 event pairs, 165 based on Foata normal form. 2/7658 useless extension candidates. Maximal degree in co-relation 304669. Up to 5449 conditions per place.). - TimeoutResultAtElement [Line: 932]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (13states, 46/94 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 304974 conditions, 7061 events (3037/7060 cut-off events. For 547050/547054 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 66080 event pairs, 165 based on Foata normal form. 2/7658 useless extension candidates. Maximal degree in co-relation 304669. Up to 5449 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (13states, 46/94 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 304974 conditions, 7061 events (3037/7060 cut-off events. For 547050/547054 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 66080 event pairs, 165 based on Foata normal form. 2/7658 useless extension candidates. Maximal degree in co-relation 304669. Up to 5449 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 127 locations, 7 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: 838.7s, OverallIterations: 48, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 827.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14081 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14081 mSDsluCounter, 11456 SdHoareTripleChecker+Invalid, 16.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7681 mSDsCounter, 2107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37005 IncrementalHoareTripleChecker+Invalid, 39112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2107 mSolverCounterUnsat, 3775 mSDtfsCounter, 37005 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1137 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 1001 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778904occurred in iteration=47, InterpolantAutomatonStates: 643, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 2780 NumberOfCodeBlocks, 2738 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2732 ConstructedInterpolants, 0 QuantifiedInterpolants, 24490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown