./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-barrier.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:54:12,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:54:12,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:54:12,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:54:12,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:54:12,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:54:12,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:54:12,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:54:12,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:54:12,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:54:12,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:54:12,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:54:12,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:54:12,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:54:12,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:54:12,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:54:12,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:54:12,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:54:12,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:54:12,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:54:12,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:54:12,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:54:12,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:54:12,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:54:12,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:54:12,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:54:12,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:54:12,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:54:12,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:54:12,572 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c [2025-03-04 06:54:12,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:54:12,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:54:12,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:54:12,798 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:54:12,798 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:54:12,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-03-04 06:54:13,996 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a94194f0/f518929922eb4492ba5ad4d1433ba3a2/FLAGf40ca4906 [2025-03-04 06:54:14,212 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:54:14,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-03-04 06:54:14,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a94194f0/f518929922eb4492ba5ad4d1433ba3a2/FLAGf40ca4906 [2025-03-04 06:54:14,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a94194f0/f518929922eb4492ba5ad4d1433ba3a2 [2025-03-04 06:54:14,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:54:14,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:54:14,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:54:14,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:54:14,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:54:14,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61afeb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14, skipping insertion in model container [2025-03-04 06:54:14,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:54:14,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:54:14,431 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:54:14,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:54:14,461 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:54:14,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14 WrapperNode [2025-03-04 06:54:14,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:54:14,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:54:14,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:54:14,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:54:14,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,487 INFO L138 Inliner]: procedures = 22, calls = 21, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 276 [2025-03-04 06:54:14,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:54:14,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:54:14,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:54:14,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:54:14,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,499 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:54:14,506 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:54:14,506 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:54:14,506 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:54:14,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (1/1) ... [2025-03-04 06:54:14,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:54:14,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:54:14,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:54:14,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:54:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:54:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:54:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:54:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:54:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:54:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:54:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:54:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 06:54:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 06:54:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:54:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-04 06:54:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-04 06:54:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-04 06:54:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-04 06:54:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:54:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:54:14,553 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:54:14,630 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:54:14,631 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:54:14,939 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:54:14,939 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:54:14,976 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:54:14,976 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:54:14,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:54:14 BoogieIcfgContainer [2025-03-04 06:54:14,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:54:14,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:54:14,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:54:14,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:54:14,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:54:14" (1/3) ... [2025-03-04 06:54:14,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14401664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:54:14, skipping insertion in model container [2025-03-04 06:54:14,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:14" (2/3) ... [2025-03-04 06:54:14,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14401664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:54:14, skipping insertion in model container [2025-03-04 06:54:14,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:54:14" (3/3) ... [2025-03-04 06:54:14,986 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2025-03-04 06:54:14,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:54:15,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier.wvr.c that has 7 procedures, 310 locations, 1 initial locations, 0 loop locations, and 20 error locations. [2025-03-04 06:54:15,000 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:54:15,122 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-04 06:54:15,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 329 transitions, 724 flow [2025-03-04 06:54:15,276 INFO L124 PetriNetUnfolderBase]: 12/315 cut-off events. [2025-03-04 06:54:15,279 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:54:15,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 315 events. 12/315 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 572 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 272. Up to 3 conditions per place. [2025-03-04 06:54:15,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 336 places, 329 transitions, 724 flow [2025-03-04 06:54:15,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 298 transitions, 641 flow [2025-03-04 06:54:15,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:54:15,309 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17a06c3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:54:15,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-04 06:54:15,319 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:54:15,321 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2025-03-04 06:54:15,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:54:15,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:15,322 INFO L206 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] [2025-03-04 06:54:15,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:15,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash -925806304, now seen corresponding path program 1 times [2025-03-04 06:54:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362263620] [2025-03-04 06:54:15,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:15,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 06:54:15,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 06:54:15,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:15,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:15,505 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-04 06:54:15,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:15,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362263620] [2025-03-04 06:54:15,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362263620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:15,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:15,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206232856] [2025-03-04 06:54:15,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:15,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:15,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:15,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:15,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 333 [2025-03-04 06:54:15,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 298 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 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-04 06:54:15,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:15,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 333 [2025-03-04 06:54:15,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:17,767 INFO L124 PetriNetUnfolderBase]: 3107/13658 cut-off events. [2025-03-04 06:54:17,767 INFO L125 PetriNetUnfolderBase]: For 1713/1713 co-relation queries the response was YES. [2025-03-04 06:54:17,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19870 conditions, 13658 events. 3107/13658 cut-off events. For 1713/1713 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 156487 event pairs, 2737 based on Foata normal form. 802/12245 useless extension candidates. Maximal degree in co-relation 19411. Up to 4387 conditions per place. [2025-03-04 06:54:17,923 INFO L140 encePairwiseOnDemand]: 323/333 looper letters, 42 selfloop transitions, 2 changer transitions 1/290 dead transitions. [2025-03-04 06:54:17,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 290 transitions, 713 flow [2025-03-04 06:54:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-04 06:54:17,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8598598598598599 [2025-03-04 06:54:17,944 INFO L175 Difference]: Start difference. First operand has 306 places, 298 transitions, 641 flow. Second operand 3 states and 859 transitions. [2025-03-04 06:54:17,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 290 transitions, 713 flow [2025-03-04 06:54:17,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 290 transitions, 684 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-04 06:54:17,962 INFO L231 Difference]: Finished difference. Result has 296 places, 289 transitions, 598 flow [2025-03-04 06:54:17,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=296, PETRI_TRANSITIONS=289} [2025-03-04 06:54:17,968 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -10 predicate places. [2025-03-04 06:54:17,968 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 289 transitions, 598 flow [2025-03-04 06:54:17,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 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-04 06:54:17,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:17,969 INFO L206 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] [2025-03-04 06:54:17,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:54:17,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash 559319458, now seen corresponding path program 1 times [2025-03-04 06:54:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:17,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754472811] [2025-03-04 06:54:17,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:17,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:54:17,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:54:17,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:17,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:18,060 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-04 06:54:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:18,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754472811] [2025-03-04 06:54:18,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754472811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:18,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:18,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783917543] [2025-03-04 06:54:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:18,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:18,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:18,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:18,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 333 [2025-03-04 06:54:18,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 289 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 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-04 06:54:18,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:18,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 333 [2025-03-04 06:54:18,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:19,528 INFO L124 PetriNetUnfolderBase]: 3215/13336 cut-off events. [2025-03-04 06:54:19,529 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2025-03-04 06:54:19,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18300 conditions, 13336 events. 3215/13336 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 149374 event pairs, 2737 based on Foata normal form. 0/11081 useless extension candidates. Maximal degree in co-relation 18243. Up to 4495 conditions per place. [2025-03-04 06:54:19,726 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 42 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-03-04 06:54:19,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 288 transitions, 684 flow [2025-03-04 06:54:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2025-03-04 06:54:19,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528528528528528 [2025-03-04 06:54:19,730 INFO L175 Difference]: Start difference. First operand has 296 places, 289 transitions, 598 flow. Second operand 3 states and 852 transitions. [2025-03-04 06:54:19,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 288 transitions, 684 flow [2025-03-04 06:54:19,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 288 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:19,737 INFO L231 Difference]: Finished difference. Result has 294 places, 288 transitions, 596 flow [2025-03-04 06:54:19,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=294, PETRI_TRANSITIONS=288} [2025-03-04 06:54:19,738 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2025-03-04 06:54:19,739 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 288 transitions, 596 flow [2025-03-04 06:54:19,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 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-04 06:54:19,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:19,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:19,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:54:19,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:19,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1519109528, now seen corresponding path program 1 times [2025-03-04 06:54:19,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:19,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371594375] [2025-03-04 06:54:19,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:19,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 06:54:19,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:54:19,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:19,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:19,879 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-04 06:54:19,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:19,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371594375] [2025-03-04 06:54:19,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371594375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:19,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:19,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509573505] [2025-03-04 06:54:19,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:19,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:19,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:19,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:19,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 333 [2025-03-04 06:54:19,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 288 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-04 06:54:19,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:19,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 333 [2025-03-04 06:54:19,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:21,061 INFO L124 PetriNetUnfolderBase]: 3107/12407 cut-off events. [2025-03-04 06:54:21,061 INFO L125 PetriNetUnfolderBase]: For 416/416 co-relation queries the response was YES. [2025-03-04 06:54:21,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17331 conditions, 12407 events. 3107/12407 cut-off events. For 416/416 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 137380 event pairs, 2737 based on Foata normal form. 0/10312 useless extension candidates. Maximal degree in co-relation 17266. Up to 4387 conditions per place. [2025-03-04 06:54:21,143 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 42 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-03-04 06:54:21,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 287 transitions, 682 flow [2025-03-04 06:54:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2025-03-04 06:54:21,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528528528528528 [2025-03-04 06:54:21,149 INFO L175 Difference]: Start difference. First operand has 294 places, 288 transitions, 596 flow. Second operand 3 states and 852 transitions. [2025-03-04 06:54:21,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 287 transitions, 682 flow [2025-03-04 06:54:21,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 287 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:21,152 INFO L231 Difference]: Finished difference. Result has 293 places, 287 transitions, 594 flow [2025-03-04 06:54:21,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=293, PETRI_TRANSITIONS=287} [2025-03-04 06:54:21,153 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -13 predicate places. [2025-03-04 06:54:21,154 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 287 transitions, 594 flow [2025-03-04 06:54:21,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-04 06:54:21,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:21,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:21,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:54:21,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:21,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1561788112, now seen corresponding path program 1 times [2025-03-04 06:54:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:21,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451685977] [2025-03-04 06:54:21,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:21,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:54:21,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:54:21,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:21,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:21,253 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-04 06:54:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451685977] [2025-03-04 06:54:21,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451685977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:21,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:21,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:21,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687611066] [2025-03-04 06:54:21,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:21,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:21,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:21,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:21,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:21,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 333 [2025-03-04 06:54:21,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 287 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-04 06:54:21,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:21,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 333 [2025-03-04 06:54:21,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:22,567 INFO L124 PetriNetUnfolderBase]: 3215/11250 cut-off events. [2025-03-04 06:54:22,567 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2025-03-04 06:54:22,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16174 conditions, 11250 events. 3215/11250 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 118487 event pairs, 2737 based on Foata normal form. 0/9317 useless extension candidates. Maximal degree in co-relation 16081. Up to 4495 conditions per place. [2025-03-04 06:54:22,674 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 42 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2025-03-04 06:54:22,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 286 transitions, 680 flow [2025-03-04 06:54:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2025-03-04 06:54:22,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528528528528528 [2025-03-04 06:54:22,676 INFO L175 Difference]: Start difference. First operand has 293 places, 287 transitions, 594 flow. Second operand 3 states and 852 transitions. [2025-03-04 06:54:22,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 286 transitions, 680 flow [2025-03-04 06:54:22,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 286 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:22,682 INFO L231 Difference]: Finished difference. Result has 292 places, 286 transitions, 592 flow [2025-03-04 06:54:22,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=292, PETRI_TRANSITIONS=286} [2025-03-04 06:54:22,683 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -14 predicate places. [2025-03-04 06:54:22,683 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 286 transitions, 592 flow [2025-03-04 06:54:22,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-04 06:54:22,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:22,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:22,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:54:22,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:22,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash 270607534, now seen corresponding path program 1 times [2025-03-04 06:54:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:22,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528421286] [2025-03-04 06:54:22,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:22,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:54:22,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:54:22,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:22,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:22,798 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-04 06:54:22,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:22,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528421286] [2025-03-04 06:54:22,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528421286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:22,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:22,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:22,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101242327] [2025-03-04 06:54:22,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:22,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:22,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:22,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:22,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:22,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:22,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 286 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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-04 06:54:22,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:22,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:22,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:24,419 INFO L124 PetriNetUnfolderBase]: 4121/17477 cut-off events. [2025-03-04 06:54:24,419 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2025-03-04 06:54:24,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24042 conditions, 17477 events. 4121/17477 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 209911 event pairs, 2888 based on Foata normal form. 0/14707 useless extension candidates. Maximal degree in co-relation 23941. Up to 4858 conditions per place. [2025-03-04 06:54:24,507 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 58 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-03-04 06:54:24,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 302 transitions, 753 flow [2025-03-04 06:54:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2025-03-04 06:54:24,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2025-03-04 06:54:24,509 INFO L175 Difference]: Start difference. First operand has 292 places, 286 transitions, 592 flow. Second operand 3 states and 874 transitions. [2025-03-04 06:54:24,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 302 transitions, 753 flow [2025-03-04 06:54:24,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 302 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:24,512 INFO L231 Difference]: Finished difference. Result has 291 places, 285 transitions, 590 flow [2025-03-04 06:54:24,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=291, PETRI_TRANSITIONS=285} [2025-03-04 06:54:24,513 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -15 predicate places. [2025-03-04 06:54:24,513 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 285 transitions, 590 flow [2025-03-04 06:54:24,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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-04 06:54:24,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:24,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:24,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:54:24,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:24,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:24,514 INFO L85 PathProgramCache]: Analyzing trace with hash 16092173, now seen corresponding path program 1 times [2025-03-04 06:54:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113191918] [2025-03-04 06:54:24,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:24,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 06:54:24,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 06:54:24,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:24,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:24,578 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-04 06:54:24,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:24,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113191918] [2025-03-04 06:54:24,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113191918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:24,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:24,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:24,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999718823] [2025-03-04 06:54:24,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:24,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:24,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:24,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:24,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:24,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 285 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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-04 06:54:24,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:24,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:24,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:25,419 INFO L124 PetriNetUnfolderBase]: 3783/10199 cut-off events. [2025-03-04 06:54:25,419 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-03-04 06:54:25,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16375 conditions, 10199 events. 3783/10199 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 96791 event pairs, 846 based on Foata normal form. 0/8547 useless extension candidates. Maximal degree in co-relation 11250. Up to 3963 conditions per place. [2025-03-04 06:54:25,501 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 56 selfloop transitions, 3 changer transitions 0/300 dead transitions. [2025-03-04 06:54:25,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 300 transitions, 747 flow [2025-03-04 06:54:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2025-03-04 06:54:25,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2025-03-04 06:54:25,503 INFO L175 Difference]: Start difference. First operand has 291 places, 285 transitions, 590 flow. Second operand 3 states and 874 transitions. [2025-03-04 06:54:25,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 300 transitions, 747 flow [2025-03-04 06:54:25,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 300 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:25,506 INFO L231 Difference]: Finished difference. Result has 289 places, 283 transitions, 588 flow [2025-03-04 06:54:25,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=289, PETRI_TRANSITIONS=283} [2025-03-04 06:54:25,507 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -17 predicate places. [2025-03-04 06:54:25,507 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 588 flow [2025-03-04 06:54:25,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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-04 06:54:25,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:25,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:25,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:54:25,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:25,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash -47314022, now seen corresponding path program 1 times [2025-03-04 06:54:25,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:25,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799660735] [2025-03-04 06:54:25,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:25,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 06:54:25,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 06:54:25,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:25,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:25,583 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-04 06:54:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:25,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799660735] [2025-03-04 06:54:25,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799660735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:25,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:25,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230952898] [2025-03-04 06:54:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:25,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:25,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:25,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:25,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 283 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-04 06:54:25,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:25,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:25,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:27,006 INFO L124 PetriNetUnfolderBase]: 4310/15222 cut-off events. [2025-03-04 06:54:27,006 INFO L125 PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES. [2025-03-04 06:54:27,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21822 conditions, 15222 events. 4310/15222 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 169582 event pairs, 3050 based on Foata normal form. 0/12614 useless extension candidates. Maximal degree in co-relation 16553. Up to 4993 conditions per place. [2025-03-04 06:54:27,071 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 59 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-03-04 06:54:27,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 300 transitions, 754 flow [2025-03-04 06:54:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2025-03-04 06:54:27,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2025-03-04 06:54:27,073 INFO L175 Difference]: Start difference. First operand has 289 places, 283 transitions, 588 flow. Second operand 3 states and 875 transitions. [2025-03-04 06:54:27,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 300 transitions, 754 flow [2025-03-04 06:54:27,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 300 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:27,076 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 584 flow [2025-03-04 06:54:27,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2025-03-04 06:54:27,077 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -18 predicate places. [2025-03-04 06:54:27,077 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 584 flow [2025-03-04 06:54:27,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-04 06:54:27,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:27,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:27,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:54:27,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread5Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1554405080, now seen corresponding path program 1 times [2025-03-04 06:54:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:27,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981723735] [2025-03-04 06:54:27,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:27,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:27,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 06:54:27,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 06:54:27,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:27,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:27,112 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-04 06:54:27,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981723735] [2025-03-04 06:54:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981723735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:27,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:27,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725711794] [2025-03-04 06:54:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:27,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:27,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:27,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:27,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:27,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:27,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-04 06:54:27,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:27,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:27,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:28,611 INFO L124 PetriNetUnfolderBase]: 4121/16000 cut-off events. [2025-03-04 06:54:28,612 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2025-03-04 06:54:28,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22507 conditions, 16000 events. 4121/16000 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 185707 event pairs, 2888 based on Foata normal form. 0/13446 useless extension candidates. Maximal degree in co-relation 17152. Up to 4858 conditions per place. [2025-03-04 06:54:28,720 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 58 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2025-03-04 06:54:28,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 298 transitions, 744 flow [2025-03-04 06:54:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2025-03-04 06:54:28,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2025-03-04 06:54:28,723 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 584 flow. Second operand 3 states and 874 transitions. [2025-03-04 06:54:28,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 298 transitions, 744 flow [2025-03-04 06:54:28,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 298 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:28,727 INFO L231 Difference]: Finished difference. Result has 287 places, 281 transitions, 582 flow [2025-03-04 06:54:28,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=287, PETRI_TRANSITIONS=281} [2025-03-04 06:54:28,728 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -19 predicate places. [2025-03-04 06:54:28,728 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 281 transitions, 582 flow [2025-03-04 06:54:28,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-04 06:54:28,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:28,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:28,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:54:28,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:28,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash -782063167, now seen corresponding path program 1 times [2025-03-04 06:54:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:28,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295609929] [2025-03-04 06:54:28,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:28,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:28,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 06:54:28,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 06:54:28,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:28,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:28,789 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-04 06:54:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295609929] [2025-03-04 06:54:28,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295609929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:28,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:28,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025092201] [2025-03-04 06:54:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:28,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:28,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:28,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:28,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:28,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:28,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 281 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-04 06:54:28,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:28,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:28,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:29,995 INFO L124 PetriNetUnfolderBase]: 3945/11033 cut-off events. [2025-03-04 06:54:29,995 INFO L125 PetriNetUnfolderBase]: For 608/608 co-relation queries the response was YES. [2025-03-04 06:54:30,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17073 conditions, 11033 events. 3945/11033 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 106908 event pairs, 1091 based on Foata normal form. 0/9195 useless extension candidates. Maximal degree in co-relation 12725. Up to 3671 conditions per place. [2025-03-04 06:54:30,059 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 57 selfloop transitions, 3 changer transitions 0/297 dead transitions. [2025-03-04 06:54:30,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 297 transitions, 744 flow [2025-03-04 06:54:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2025-03-04 06:54:30,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2025-03-04 06:54:30,061 INFO L175 Difference]: Start difference. First operand has 287 places, 281 transitions, 582 flow. Second operand 3 states and 875 transitions. [2025-03-04 06:54:30,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 297 transitions, 744 flow [2025-03-04 06:54:30,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 297 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:30,064 INFO L231 Difference]: Finished difference. Result has 285 places, 279 transitions, 580 flow [2025-03-04 06:54:30,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=285, PETRI_TRANSITIONS=279} [2025-03-04 06:54:30,065 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -21 predicate places. [2025-03-04 06:54:30,065 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 279 transitions, 580 flow [2025-03-04 06:54:30,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-04 06:54:30,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:30,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:30,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:54:30,066 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread5Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:30,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1054895458, now seen corresponding path program 1 times [2025-03-04 06:54:30,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:30,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286058012] [2025-03-04 06:54:30,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:30,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 06:54:30,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 06:54:30,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:30,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:30,116 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-04 06:54:30,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286058012] [2025-03-04 06:54:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286058012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536261981] [2025-03-04 06:54:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:30,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:30,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:30,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:30,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 279 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-04 06:54:30,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:30,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:30,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:31,103 INFO L124 PetriNetUnfolderBase]: 3783/11485 cut-off events. [2025-03-04 06:54:31,104 INFO L125 PetriNetUnfolderBase]: For 449/449 co-relation queries the response was YES. [2025-03-04 06:54:31,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17571 conditions, 11485 events. 3783/11485 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 116605 event pairs, 1156 based on Foata normal form. 0/9835 useless extension candidates. Maximal degree in co-relation 13208. Up to 3892 conditions per place. [2025-03-04 06:54:31,157 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 56 selfloop transitions, 3 changer transitions 0/294 dead transitions. [2025-03-04 06:54:31,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 294 transitions, 736 flow [2025-03-04 06:54:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2025-03-04 06:54:31,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2025-03-04 06:54:31,159 INFO L175 Difference]: Start difference. First operand has 285 places, 279 transitions, 580 flow. Second operand 3 states and 874 transitions. [2025-03-04 06:54:31,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 294 transitions, 736 flow [2025-03-04 06:54:31,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 294 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:31,163 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 576 flow [2025-03-04 06:54:31,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2025-03-04 06:54:31,163 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -23 predicate places. [2025-03-04 06:54:31,163 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 576 flow [2025-03-04 06:54:31,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-04 06:54:31,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:31,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:31,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:54:31,164 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread6Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:31,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1018432933, now seen corresponding path program 1 times [2025-03-04 06:54:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:31,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609673007] [2025-03-04 06:54:31,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:31,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 06:54:31,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 06:54:31,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:31,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:31,205 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-04 06:54:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609673007] [2025-03-04 06:54:31,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609673007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:31,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:31,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:31,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341223937] [2025-03-04 06:54:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:31,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:31,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:31,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:31,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:31,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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-04 06:54:31,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:31,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:31,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:32,383 INFO L124 PetriNetUnfolderBase]: 4310/11722 cut-off events. [2025-03-04 06:54:32,383 INFO L125 PetriNetUnfolderBase]: For 695/695 co-relation queries the response was YES. [2025-03-04 06:54:32,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18436 conditions, 11722 events. 4310/11722 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 114301 event pairs, 3050 based on Foata normal form. 0/9795 useless extension candidates. Maximal degree in co-relation 13915. Up to 4993 conditions per place. [2025-03-04 06:54:32,443 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 59 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2025-03-04 06:54:32,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 294 transitions, 741 flow [2025-03-04 06:54:32,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2025-03-04 06:54:32,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2025-03-04 06:54:32,444 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 576 flow. Second operand 3 states and 875 transitions. [2025-03-04 06:54:32,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 294 transitions, 741 flow [2025-03-04 06:54:32,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 294 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:32,449 INFO L231 Difference]: Finished difference. Result has 282 places, 276 transitions, 572 flow [2025-03-04 06:54:32,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=282, PETRI_TRANSITIONS=276} [2025-03-04 06:54:32,450 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -24 predicate places. [2025-03-04 06:54:32,450 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 276 transitions, 572 flow [2025-03-04 06:54:32,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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-04 06:54:32,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:32,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:32,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:54:32,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1193086740, now seen corresponding path program 1 times [2025-03-04 06:54:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:32,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235066133] [2025-03-04 06:54:32,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:32,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:32,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 06:54:32,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 06:54:32,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:32,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:32,484 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-04 06:54:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235066133] [2025-03-04 06:54:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235066133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:32,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:32,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:32,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895458984] [2025-03-04 06:54:32,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:32,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:32,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:32,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:32,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:32,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 276 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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-04 06:54:32,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:32,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:32,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:33,892 INFO L124 PetriNetUnfolderBase]: 4121/13882 cut-off events. [2025-03-04 06:54:33,892 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2025-03-04 06:54:33,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20497 conditions, 13882 events. 4121/13882 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 151151 event pairs, 3050 based on Foata normal form. 0/11829 useless extension candidates. Maximal degree in co-relation 14228. Up to 4858 conditions per place. [2025-03-04 06:54:33,977 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 58 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-03-04 06:54:33,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 292 transitions, 733 flow [2025-03-04 06:54:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2025-03-04 06:54:33,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2025-03-04 06:54:33,980 INFO L175 Difference]: Start difference. First operand has 282 places, 276 transitions, 572 flow. Second operand 3 states and 874 transitions. [2025-03-04 06:54:33,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 292 transitions, 733 flow [2025-03-04 06:54:33,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 292 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:33,983 INFO L231 Difference]: Finished difference. Result has 281 places, 275 transitions, 570 flow [2025-03-04 06:54:33,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=281, PETRI_TRANSITIONS=275} [2025-03-04 06:54:33,984 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -25 predicate places. [2025-03-04 06:54:33,984 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 275 transitions, 570 flow [2025-03-04 06:54:33,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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-04 06:54:33,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:33,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:33,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:54:33,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread6Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash -485744549, now seen corresponding path program 1 times [2025-03-04 06:54:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072122585] [2025-03-04 06:54:33,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:33,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:33,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 06:54:33,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 06:54:33,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:33,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:34,025 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-04 06:54:34,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:34,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072122585] [2025-03-04 06:54:34,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072122585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:34,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:34,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:34,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748728484] [2025-03-04 06:54:34,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:34,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:34,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:34,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:34,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:34,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:34,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 275 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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-04 06:54:34,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:34,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:34,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:35,244 INFO L124 PetriNetUnfolderBase]: 3945/10611 cut-off events. [2025-03-04 06:54:35,244 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2025-03-04 06:54:35,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16621 conditions, 10611 events. 3945/10611 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 100371 event pairs, 1131 based on Foata normal form. 0/9098 useless extension candidates. Maximal degree in co-relation 12507. Up to 3600 conditions per place. [2025-03-04 06:54:35,293 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 57 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2025-03-04 06:54:35,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 291 transitions, 731 flow [2025-03-04 06:54:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2025-03-04 06:54:35,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2025-03-04 06:54:35,299 INFO L175 Difference]: Start difference. First operand has 281 places, 275 transitions, 570 flow. Second operand 3 states and 875 transitions. [2025-03-04 06:54:35,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 291 transitions, 731 flow [2025-03-04 06:54:35,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 291 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:35,301 INFO L231 Difference]: Finished difference. Result has 279 places, 273 transitions, 568 flow [2025-03-04 06:54:35,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=279, PETRI_TRANSITIONS=273} [2025-03-04 06:54:35,302 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -27 predicate places. [2025-03-04 06:54:35,302 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 273 transitions, 568 flow [2025-03-04 06:54:35,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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-04 06:54:35,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:35,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:35,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:54:35,303 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:35,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash -574073144, now seen corresponding path program 1 times [2025-03-04 06:54:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785932953] [2025-03-04 06:54:35,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:35,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:35,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 06:54:35,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 06:54:35,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:35,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:35,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:35,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785932953] [2025-03-04 06:54:35,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785932953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:35,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:35,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:35,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002411652] [2025-03-04 06:54:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:35,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:35,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:35,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:35,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:35,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:35,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 273 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-04 06:54:35,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:35,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:35,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:36,527 INFO L124 PetriNetUnfolderBase]: 4310/12771 cut-off events. [2025-03-04 06:54:36,527 INFO L125 PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES. [2025-03-04 06:54:36,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19716 conditions, 12771 events. 4310/12771 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 131145 event pairs, 3050 based on Foata normal form. 0/11024 useless extension candidates. Maximal degree in co-relation 14794. Up to 4993 conditions per place. [2025-03-04 06:54:36,591 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 55 selfloop transitions, 2 changer transitions 6/290 dead transitions. [2025-03-04 06:54:36,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 290 transitions, 734 flow [2025-03-04 06:54:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2025-03-04 06:54:36,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2025-03-04 06:54:36,593 INFO L175 Difference]: Start difference. First operand has 279 places, 273 transitions, 568 flow. Second operand 3 states and 875 transitions. [2025-03-04 06:54:36,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 290 transitions, 734 flow [2025-03-04 06:54:36,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 290 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:36,598 INFO L231 Difference]: Finished difference. Result has 278 places, 268 transitions, 554 flow [2025-03-04 06:54:36,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=278, PETRI_TRANSITIONS=268} [2025-03-04 06:54:36,599 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -28 predicate places. [2025-03-04 06:54:36,599 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 268 transitions, 554 flow [2025-03-04 06:54:36,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-04 06:54:36,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:36,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:54:36,600 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:36,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash -774053787, now seen corresponding path program 1 times [2025-03-04 06:54:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869830244] [2025-03-04 06:54:36,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:36,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 06:54:36,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 06:54:36,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:36,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:36,630 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-04 06:54:36,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869830244] [2025-03-04 06:54:36,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869830244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:36,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:36,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:36,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473094592] [2025-03-04 06:54:36,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:36,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:36,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:36,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:36,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:36,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:36,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 268 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-04 06:54:36,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:36,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:36,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:37,733 INFO L124 PetriNetUnfolderBase]: 4048/11520 cut-off events. [2025-03-04 06:54:37,733 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2025-03-04 06:54:37,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18048 conditions, 11520 events. 4048/11520 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 116179 event pairs, 3009 based on Foata normal form. 0/10131 useless extension candidates. Maximal degree in co-relation 13640. Up to 4758 conditions per place. [2025-03-04 06:54:37,787 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 54 selfloop transitions, 2 changer transitions 4/284 dead transitions. [2025-03-04 06:54:37,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 284 transitions, 710 flow [2025-03-04 06:54:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2025-03-04 06:54:37,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8728728728728729 [2025-03-04 06:54:37,788 INFO L175 Difference]: Start difference. First operand has 278 places, 268 transitions, 554 flow. Second operand 3 states and 872 transitions. [2025-03-04 06:54:37,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 284 transitions, 710 flow [2025-03-04 06:54:37,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 284 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:37,792 INFO L231 Difference]: Finished difference. Result has 274 places, 264 transitions, 546 flow [2025-03-04 06:54:37,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=274, PETRI_TRANSITIONS=264} [2025-03-04 06:54:37,793 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -32 predicate places. [2025-03-04 06:54:37,793 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 264 transitions, 546 flow [2025-03-04 06:54:37,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-04 06:54:37,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:37,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:37,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:54:37,793 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread6Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:54:37,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash 687526562, now seen corresponding path program 1 times [2025-03-04 06:54:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:37,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205005350] [2025-03-04 06:54:37,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:37,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 06:54:37,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 06:54:37,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:37,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:37,827 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-04 06:54:37,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:37,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205005350] [2025-03-04 06:54:37,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205005350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:37,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:37,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848396345] [2025-03-04 06:54:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:37,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:37,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:37,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:37,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:37,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-03-04 06:54:37,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 264 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 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-04 06:54:37,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:37,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-03-04 06:54:37,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:38,851 INFO L124 PetriNetUnfolderBase]: 3872/10643 cut-off events. [2025-03-04 06:54:38,852 INFO L125 PetriNetUnfolderBase]: For 605/605 co-relation queries the response was YES. [2025-03-04 06:54:38,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16776 conditions, 10643 events. 3872/10643 cut-off events. For 605/605 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 103931 event pairs, 2696 based on Foata normal form. 0/9319 useless extension candidates. Maximal degree in co-relation 12652. Up to 4393 conditions per place. [2025-03-04 06:54:38,880 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2025-03-04 06:54:38,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 281 transitions, 705 flow [2025-03-04 06:54:38,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2025-03-04 06:54:38,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8728728728728729 [2025-03-04 06:54:38,882 INFO L175 Difference]: Start difference. First operand has 274 places, 264 transitions, 546 flow. Second operand 3 states and 872 transitions. [2025-03-04 06:54:38,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 281 transitions, 705 flow [2025-03-04 06:54:38,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 281 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:38,888 INFO L231 Difference]: Finished difference. Result has 270 places, 0 transitions, 0 flow [2025-03-04 06:54:38,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=270, PETRI_TRANSITIONS=0} [2025-03-04 06:54:38,888 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -36 predicate places. [2025-03-04 06:54:38,888 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 0 transitions, 0 flow [2025-03-04 06:54:38,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 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-04 06:54:38,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-03-04 06:54:38,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 46 remaining) [2025-03-04 06:54:38,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork5Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork5Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-03-04 06:54:38,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork2Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 46 remaining) [2025-03-04 06:54:38,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork2Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 46 remaining) [2025-03-04 06:54:38,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-03-04 06:54:38,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-03-04 06:54:38,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-03-04 06:54:38,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-03-04 06:54:38,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-03-04 06:54:38,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-03-04 06:54:38,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-03-04 06:54:38,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-03-04 06:54:38,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:54:38,894 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:38,899 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:54:38,899 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:54:38,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:54:38 BasicIcfg [2025-03-04 06:54:38,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:54:38,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:54:38,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:54:38,906 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:54:38,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:54:14" (3/4) ... [2025-03-04 06:54:38,908 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:54:38,910 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:54:38,911 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:54:38,911 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:54:38,911 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-04 06:54:38,911 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-03-04 06:54:38,911 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-03-04 06:54:38,913 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 06:54:38,913 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:54:38,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 06:54:38,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:54:38,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:54:38,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:54:38,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:54:38,975 INFO L158 Benchmark]: Toolchain (without parser) took 24713.04ms. Allocated memory was 142.6MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 114.0MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-04 06:54:38,975 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:54:38,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.04ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 101.6MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:54:38,976 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.41ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:54:38,977 INFO L158 Benchmark]: Boogie Preprocessor took 17.01ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:54:38,977 INFO L158 Benchmark]: IcfgBuilder took 470.71ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 74.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:54:38,977 INFO L158 Benchmark]: TraceAbstraction took 23924.68ms. Allocated memory was 142.6MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 73.8MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-03-04 06:54:38,978 INFO L158 Benchmark]: Witness Printer took 68.51ms. Allocated memory is still 7.6GB. Free memory was 5.9GB in the beginning and 5.9GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:54:38,979 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.04ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 101.6MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.41ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.01ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 470.71ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 74.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23924.68ms. Allocated memory was 142.6MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 73.8MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 68.51ms. Allocated memory is still 7.6GB. Free memory was 5.9GB in the beginning and 5.9GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 502 locations, 46 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: 23.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 703 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 96 mSDtfsCounter, 1698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1784 NumberOfCodeBlocks, 1784 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 1800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:54:38,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE