./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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/popl20-threaded-sum-3.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 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:26:25,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:26:25,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:26:25,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:26:25,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:26:25,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:26:25,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:26:25,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:26:25,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:26:25,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:26:25,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:26:25,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:26:25,586 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:26:25,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:26:25,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:26:25,587 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:26:25,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:26:25,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:26:25,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:26:25,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:26:25,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:26:25,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:26:25,587 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:26:25,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:26:25,588 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:26:25,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:26:25,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:26:25,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:26:25,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:26:25,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:26:25,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:26:25,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:25,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:26:25,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:26:25,589 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:26:25,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:26:25,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:26:25,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:26:25,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:26:25,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:26:25,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:26:25,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:26:25,589 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2025-03-13 22:26:25,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:26:25,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:26:25,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:26:25,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:26:25,823 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:26:25,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-03-13 22:26:26,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691243235/0a9a6ff61336409eaf8ffaf2f4979738/FLAG426ac7331 [2025-03-13 22:26:27,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:26:27,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-03-13 22:26:27,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691243235/0a9a6ff61336409eaf8ffaf2f4979738/FLAG426ac7331 [2025-03-13 22:26:27,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691243235/0a9a6ff61336409eaf8ffaf2f4979738 [2025-03-13 22:26:27,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:26:27,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:26:27,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:27,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:26:27,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:26:27,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58726798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27, skipping insertion in model container [2025-03-13 22:26:27,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:26:27,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:27,655 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:26:27,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:27,692 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:26:27,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27 WrapperNode [2025-03-13 22:26:27,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:27,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:27,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:26:27,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:26:27,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,720 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2025-03-13 22:26:27,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:27,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:26:27,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:26:27,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:26:27,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:26:27,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:26:27,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:26:27,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:26:27,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (1/1) ... [2025-03-13 22:26:27,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:27,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:27,782 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-13 22:26:27,784 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-13 22:26:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:26:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:26:27,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:26:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:26:27,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:26:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:26:27,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:26:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:26:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:26:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:26:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:26:27,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:26:27,804 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:26:27,872 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:26:27,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:26:28,266 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:26:28,267 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:26:28,267 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:26:28,472 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:26:28,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:28 BoogieIcfgContainer [2025-03-13 22:26:28,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:26:28,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:26:28,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:26:28,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:26:28,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:26:27" (1/3) ... [2025-03-13 22:26:28,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baceec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:28, skipping insertion in model container [2025-03-13 22:26:28,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:27" (2/3) ... [2025-03-13 22:26:28,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baceec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:28, skipping insertion in model container [2025-03-13 22:26:28,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:28" (3/3) ... [2025-03-13 22:26:28,482 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-03-13 22:26:28,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:26:28,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 196 locations, 1 initial locations, 3 loop locations, and 42 error locations. [2025-03-13 22:26:28,496 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:26:28,582 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:26:28,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 202 transitions, 425 flow [2025-03-13 22:26:28,677 INFO L124 PetriNetUnfolderBase]: 7/199 cut-off events. [2025-03-13 22:26:28,678 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:26:28,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 199 events. 7/199 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 232 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2025-03-13 22:26:28,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 202 transitions, 425 flow [2025-03-13 22:26:28,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 182 transitions, 382 flow [2025-03-13 22:26:28,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:26:28,704 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;@3468e759, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:26:28,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-13 22:26:28,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:26:28,709 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-13 22:26:28,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:26:28,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:28,711 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] [2025-03-13 22:26:28,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:28,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1577953636, now seen corresponding path program 1 times [2025-03-13 22:26:28,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:28,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762610371] [2025-03-13 22:26:28,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:28,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:28,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 22:26:28,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 22:26:28,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:28,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:28,841 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-13 22:26:28,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:28,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762610371] [2025-03-13 22:26:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762610371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:28,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756088590] [2025-03-13 22:26:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:28,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:28,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:28,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 202 [2025-03-13 22:26:28,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 182 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-13 22:26:28,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:28,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 202 [2025-03-13 22:26:28,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:29,054 INFO L124 PetriNetUnfolderBase]: 124/397 cut-off events. [2025-03-13 22:26:29,056 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-13 22:26:29,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 397 events. 124/397 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1315 event pairs, 74 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 464. Up to 194 conditions per place. [2025-03-13 22:26:29,061 INFO L140 encePairwiseOnDemand]: 172/202 looper letters, 22 selfloop transitions, 2 changer transitions 1/154 dead transitions. [2025-03-13 22:26:29,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 154 transitions, 374 flow [2025-03-13 22:26:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2025-03-13 22:26:29,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8135313531353136 [2025-03-13 22:26:29,077 INFO L175 Difference]: Start difference. First operand has 186 places, 182 transitions, 382 flow. Second operand 3 states and 493 transitions. [2025-03-13 22:26:29,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 154 transitions, 374 flow [2025-03-13 22:26:29,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 154 transitions, 362 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:26:29,087 INFO L231 Difference]: Finished difference. Result has 155 places, 153 transitions, 316 flow [2025-03-13 22:26:29,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=155, PETRI_TRANSITIONS=153} [2025-03-13 22:26:29,093 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -31 predicate places. [2025-03-13 22:26:29,094 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 153 transitions, 316 flow [2025-03-13 22:26:29,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-13 22:26:29,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:29,095 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] [2025-03-13 22:26:29,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:26:29,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:29,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1449693692, now seen corresponding path program 1 times [2025-03-13 22:26:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:29,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049208453] [2025-03-13 22:26:29,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:29,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:26:29,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:26:29,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:29,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:29,140 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-13 22:26:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049208453] [2025-03-13 22:26:29,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049208453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:29,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:29,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985769058] [2025-03-13 22:26:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:29,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:29,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:29,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:29,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 202 [2025-03-13 22:26:29,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 153 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-13 22:26:29,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:29,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 202 [2025-03-13 22:26:29,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:29,269 INFO L124 PetriNetUnfolderBase]: 124/395 cut-off events. [2025-03-13 22:26:29,269 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:29,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 395 events. 124/395 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1311 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 576. Up to 194 conditions per place. [2025-03-13 22:26:29,271 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 22 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-03-13 22:26:29,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 152 transitions, 362 flow [2025-03-13 22:26:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2025-03-13 22:26:29,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.768976897689769 [2025-03-13 22:26:29,273 INFO L175 Difference]: Start difference. First operand has 155 places, 153 transitions, 316 flow. Second operand 3 states and 466 transitions. [2025-03-13 22:26:29,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 152 transitions, 362 flow [2025-03-13 22:26:29,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:29,276 INFO L231 Difference]: Finished difference. Result has 153 places, 152 transitions, 314 flow [2025-03-13 22:26:29,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=153, PETRI_TRANSITIONS=152} [2025-03-13 22:26:29,277 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -33 predicate places. [2025-03-13 22:26:29,277 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 152 transitions, 314 flow [2025-03-13 22:26:29,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-13 22:26:29,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:29,278 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] [2025-03-13 22:26:29,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:26:29,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:29,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:29,279 INFO L85 PathProgramCache]: Analyzing trace with hash -413016460, now seen corresponding path program 1 times [2025-03-13 22:26:29,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:29,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863331532] [2025-03-13 22:26:29,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:29,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:29,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 22:26:29,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 22:26:29,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:29,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:29,326 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-13 22:26:29,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:29,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863331532] [2025-03-13 22:26:29,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863331532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:29,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:29,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:29,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049847355] [2025-03-13 22:26:29,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:29,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:29,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:29,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:29,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 202 [2025-03-13 22:26:29,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-13 22:26:29,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:29,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 202 [2025-03-13 22:26:29,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:29,416 INFO L124 PetriNetUnfolderBase]: 124/394 cut-off events. [2025-03-13 22:26:29,416 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:29,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 394 events. 124/394 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1308 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 568. Up to 194 conditions per place. [2025-03-13 22:26:29,419 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 22 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-03-13 22:26:29,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 151 transitions, 360 flow [2025-03-13 22:26:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2025-03-13 22:26:29,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.768976897689769 [2025-03-13 22:26:29,420 INFO L175 Difference]: Start difference. First operand has 153 places, 152 transitions, 314 flow. Second operand 3 states and 466 transitions. [2025-03-13 22:26:29,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 151 transitions, 360 flow [2025-03-13 22:26:29,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 151 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:29,422 INFO L231 Difference]: Finished difference. Result has 152 places, 151 transitions, 312 flow [2025-03-13 22:26:29,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=152, PETRI_TRANSITIONS=151} [2025-03-13 22:26:29,423 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -34 predicate places. [2025-03-13 22:26:29,424 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 151 transitions, 312 flow [2025-03-13 22:26:29,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-13 22:26:29,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:29,424 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] [2025-03-13 22:26:29,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:26:29,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:29,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1902521727, now seen corresponding path program 1 times [2025-03-13 22:26:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:29,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115723056] [2025-03-13 22:26:29,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:29,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:29,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 22:26:29,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 22:26:29,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:29,482 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-13 22:26:29,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115723056] [2025-03-13 22:26:29,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115723056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:29,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233539078] [2025-03-13 22:26:29,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:29,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:29,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:29,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 202 [2025-03-13 22:26:29,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 151 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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-13 22:26:29,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:29,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 202 [2025-03-13 22:26:29,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:29,568 INFO L124 PetriNetUnfolderBase]: 124/391 cut-off events. [2025-03-13 22:26:29,568 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:29,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 391 events. 124/391 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1297 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 557. Up to 193 conditions per place. [2025-03-13 22:26:29,570 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 22 selfloop transitions, 1 changer transitions 0/148 dead transitions. [2025-03-13 22:26:29,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 148 transitions, 352 flow [2025-03-13 22:26:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-03-13 22:26:29,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7706270627062707 [2025-03-13 22:26:29,572 INFO L175 Difference]: Start difference. First operand has 152 places, 151 transitions, 312 flow. Second operand 3 states and 467 transitions. [2025-03-13 22:26:29,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 148 transitions, 352 flow [2025-03-13 22:26:29,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 148 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:29,574 INFO L231 Difference]: Finished difference. Result has 149 places, 148 transitions, 304 flow [2025-03-13 22:26:29,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=149, PETRI_TRANSITIONS=148} [2025-03-13 22:26:29,575 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -37 predicate places. [2025-03-13 22:26:29,575 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 304 flow [2025-03-13 22:26:29,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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-13 22:26:29,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:29,575 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] [2025-03-13 22:26:29,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:26:29,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:29,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash 830148037, now seen corresponding path program 1 times [2025-03-13 22:26:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:29,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716284708] [2025-03-13 22:26:29,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:29,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:29,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:26:29,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:26:29,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:29,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:29,620 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-13 22:26:29,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:29,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716284708] [2025-03-13 22:26:29,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716284708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:29,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313596512] [2025-03-13 22:26:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:29,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:29,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:29,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:29,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:29,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 202 [2025-03-13 22:26:29,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-13 22:26:29,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:29,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 202 [2025-03-13 22:26:29,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:29,710 INFO L124 PetriNetUnfolderBase]: 124/390 cut-off events. [2025-03-13 22:26:29,713 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:29,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 390 events. 124/390 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1311 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 553. Up to 191 conditions per place. [2025-03-13 22:26:29,715 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 19 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-03-13 22:26:29,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 147 transitions, 344 flow [2025-03-13 22:26:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-03-13 22:26:29,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7788778877887789 [2025-03-13 22:26:29,718 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 304 flow. Second operand 3 states and 472 transitions. [2025-03-13 22:26:29,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 147 transitions, 344 flow [2025-03-13 22:26:29,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 343 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:29,721 INFO L231 Difference]: Finished difference. Result has 149 places, 147 transitions, 305 flow [2025-03-13 22:26:29,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=149, PETRI_TRANSITIONS=147} [2025-03-13 22:26:29,722 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -37 predicate places. [2025-03-13 22:26:29,723 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 147 transitions, 305 flow [2025-03-13 22:26:29,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-13 22:26:29,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:29,723 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] [2025-03-13 22:26:29,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:26:29,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:29,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash 518996533, now seen corresponding path program 1 times [2025-03-13 22:26:29,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:29,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795430192] [2025-03-13 22:26:29,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:29,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:29,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:26:29,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:26:29,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:29,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:29,767 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-13 22:26:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:29,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795430192] [2025-03-13 22:26:29,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795430192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:29,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552042937] [2025-03-13 22:26:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:29,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:29,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:29,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:29,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 202 [2025-03-13 22:26:29,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 147 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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-13 22:26:29,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:29,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 202 [2025-03-13 22:26:29,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:29,852 INFO L124 PetriNetUnfolderBase]: 124/387 cut-off events. [2025-03-13 22:26:29,852 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:29,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 387 events. 124/387 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1296 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 554. Up to 193 conditions per place. [2025-03-13 22:26:29,854 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 22 selfloop transitions, 1 changer transitions 0/144 dead transitions. [2025-03-13 22:26:29,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 345 flow [2025-03-13 22:26:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-03-13 22:26:29,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7706270627062707 [2025-03-13 22:26:29,858 INFO L175 Difference]: Start difference. First operand has 149 places, 147 transitions, 305 flow. Second operand 3 states and 467 transitions. [2025-03-13 22:26:29,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 345 flow [2025-03-13 22:26:29,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 144 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:29,860 INFO L231 Difference]: Finished difference. Result has 146 places, 144 transitions, 297 flow [2025-03-13 22:26:29,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=146, PETRI_TRANSITIONS=144} [2025-03-13 22:26:29,861 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -40 predicate places. [2025-03-13 22:26:29,861 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 144 transitions, 297 flow [2025-03-13 22:26:29,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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-13 22:26:29,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:29,862 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-13 22:26:29,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:26:29,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:29,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1251209341, now seen corresponding path program 1 times [2025-03-13 22:26:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:29,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107022924] [2025-03-13 22:26:29,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:29,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:26:29,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:26:29,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:29,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:29,902 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-13 22:26:29,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:29,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107022924] [2025-03-13 22:26:29,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107022924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:29,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:29,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:29,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062396141] [2025-03-13 22:26:29,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:29,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:29,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:29,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:29,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:29,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 202 [2025-03-13 22:26:29,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 144 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-13 22:26:29,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:29,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 202 [2025-03-13 22:26:29,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:29,972 INFO L124 PetriNetUnfolderBase]: 124/386 cut-off events. [2025-03-13 22:26:29,972 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:29,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 386 events. 124/386 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1291 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 550. Up to 191 conditions per place. [2025-03-13 22:26:29,974 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 19 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2025-03-13 22:26:29,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 143 transitions, 337 flow [2025-03-13 22:26:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-03-13 22:26:29,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7788778877887789 [2025-03-13 22:26:29,975 INFO L175 Difference]: Start difference. First operand has 146 places, 144 transitions, 297 flow. Second operand 3 states and 472 transitions. [2025-03-13 22:26:29,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 143 transitions, 337 flow [2025-03-13 22:26:29,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 143 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:29,977 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 298 flow [2025-03-13 22:26:29,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-03-13 22:26:29,978 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -40 predicate places. [2025-03-13 22:26:29,979 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 298 flow [2025-03-13 22:26:29,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-13 22:26:29,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:29,979 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] [2025-03-13 22:26:29,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:26:29,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:29,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:29,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1244349783, now seen corresponding path program 1 times [2025-03-13 22:26:29,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:29,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675384344] [2025-03-13 22:26:29,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:29,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 22:26:29,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:26:29,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:29,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:30,015 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-13 22:26:30,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:30,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675384344] [2025-03-13 22:26:30,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675384344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:30,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:30,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:30,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487202889] [2025-03-13 22:26:30,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:30,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:30,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:30,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:30,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:30,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 202 [2025-03-13 22:26:30,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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-13 22:26:30,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:30,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 202 [2025-03-13 22:26:30,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:30,083 INFO L124 PetriNetUnfolderBase]: 124/383 cut-off events. [2025-03-13 22:26:30,083 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:30,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 383 events. 124/383 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1302 event pairs, 74 based on Foata normal form. 1/347 useless extension candidates. Maximal degree in co-relation 550. Up to 192 conditions per place. [2025-03-13 22:26:30,086 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 20 selfloop transitions, 1 changer transitions 6/140 dead transitions. [2025-03-13 22:26:30,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 140 transitions, 336 flow [2025-03-13 22:26:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2025-03-13 22:26:30,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.768976897689769 [2025-03-13 22:26:30,088 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 298 flow. Second operand 3 states and 466 transitions. [2025-03-13 22:26:30,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 140 transitions, 336 flow [2025-03-13 22:26:30,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:30,089 INFO L231 Difference]: Finished difference. Result has 143 places, 134 transitions, 278 flow [2025-03-13 22:26:30,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=143, PETRI_TRANSITIONS=134} [2025-03-13 22:26:30,090 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -43 predicate places. [2025-03-13 22:26:30,090 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 134 transitions, 278 flow [2025-03-13 22:26:30,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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-13 22:26:30,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:30,091 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] [2025-03-13 22:26:30,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:26:30,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:30,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:30,091 INFO L85 PathProgramCache]: Analyzing trace with hash 251359661, now seen corresponding path program 1 times [2025-03-13 22:26:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:30,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498775250] [2025-03-13 22:26:30,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:30,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-13 22:26:30,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-13 22:26:30,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:30,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:30,132 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-13 22:26:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498775250] [2025-03-13 22:26:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498775250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948315997] [2025-03-13 22:26:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:30,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:30,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:30,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:30,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 202 [2025-03-13 22:26:30,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 134 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-13 22:26:30,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:30,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 202 [2025-03-13 22:26:30,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:30,196 INFO L124 PetriNetUnfolderBase]: 124/376 cut-off events. [2025-03-13 22:26:30,196 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:30,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 376 events. 124/376 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1311 event pairs, 74 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 541. Up to 191 conditions per place. [2025-03-13 22:26:30,198 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 19 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2025-03-13 22:26:30,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 318 flow [2025-03-13 22:26:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-03-13 22:26:30,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7788778877887789 [2025-03-13 22:26:30,200 INFO L175 Difference]: Start difference. First operand has 143 places, 134 transitions, 278 flow. Second operand 3 states and 472 transitions. [2025-03-13 22:26:30,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 318 flow [2025-03-13 22:26:30,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:30,202 INFO L231 Difference]: Finished difference. Result has 137 places, 133 transitions, 279 flow [2025-03-13 22:26:30,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2025-03-13 22:26:30,202 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -49 predicate places. [2025-03-13 22:26:30,202 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 279 flow [2025-03-13 22:26:30,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-13 22:26:30,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:30,203 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-13 22:26:30,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:26:30,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-13 22:26:30,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1131482123, now seen corresponding path program 1 times [2025-03-13 22:26:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:30,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654004870] [2025-03-13 22:26:30,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:30,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-13 22:26:30,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 22:26:30,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:30,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:30,284 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-13 22:26:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:30,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654004870] [2025-03-13 22:26:30,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654004870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:30,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:30,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:30,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269089080] [2025-03-13 22:26:30,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:30,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:30,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:30,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:30,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:30,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 202 [2025-03-13 22:26:30,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-13 22:26:30,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:30,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 202 [2025-03-13 22:26:30,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:30,349 INFO L124 PetriNetUnfolderBase]: 124/375 cut-off events. [2025-03-13 22:26:30,350 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:30,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 375 events. 124/375 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1319 event pairs, 74 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 539. Up to 188 conditions per place. [2025-03-13 22:26:30,351 INFO L140 encePairwiseOnDemand]: 200/202 looper letters, 0 selfloop transitions, 0 changer transitions 132/132 dead transitions. [2025-03-13 22:26:30,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 132 transitions, 311 flow [2025-03-13 22:26:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2025-03-13 22:26:30,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7920792079207921 [2025-03-13 22:26:30,352 INFO L175 Difference]: Start difference. First operand has 137 places, 133 transitions, 279 flow. Second operand 3 states and 480 transitions. [2025-03-13 22:26:30,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 132 transitions, 311 flow [2025-03-13 22:26:30,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 132 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:30,353 INFO L231 Difference]: Finished difference. Result has 136 places, 0 transitions, 0 flow [2025-03-13 22:26:30,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=136, PETRI_TRANSITIONS=0} [2025-03-13 22:26:30,354 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -50 predicate places. [2025-03-13 22:26:30,354 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 0 transitions, 0 flow [2025-03-13 22:26:30,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-13 22:26:30,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-03-13 22:26:30,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-03-13 22:26:30,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-03-13 22:26:30,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-03-13 22:26:30,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-03-13 22:26:30,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-03-13 22:26:30,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-03-13 22:26:30,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-03-13 22:26:30,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-03-13 22:26:30,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-03-13 22:26:30,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-03-13 22:26:30,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-03-13 22:26:30,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:26:30,363 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:30,367 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:26:30,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:26:30,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:26:30 BasicIcfg [2025-03-13 22:26:30,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:26:30,371 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:26:30,371 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:26:30,371 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:26:30,372 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:28" (3/4) ... [2025-03-13 22:26:30,372 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:26:30,374 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:26:30,374 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:26:30,374 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 22:26:30,377 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-13 22:26:30,378 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:26:30,378 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:26:30,378 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:26:30,430 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:26:30,431 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:26:30,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:26:30,431 INFO L158 Benchmark]: Toolchain (without parser) took 2907.93ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 109.9MB in the beginning and 180.7MB in the end (delta: -70.9MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2025-03-13 22:26:30,431 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:30,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.99ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 97.3MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:26:30,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.87ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:30,432 INFO L158 Benchmark]: Boogie Preprocessor took 30.23ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.4MB in the end (delta: 980.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:30,432 INFO L158 Benchmark]: IcfgBuilder took 722.25ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 42.1MB in the end (delta: 52.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-13 22:26:30,432 INFO L158 Benchmark]: TraceAbstraction took 1894.74ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 42.1MB in the beginning and 186.7MB in the end (delta: -144.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:30,432 INFO L158 Benchmark]: Witness Printer took 59.88ms. Allocated memory is still 285.2MB. Free memory was 186.7MB in the beginning and 180.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:30,433 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.28ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.99ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 97.3MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.87ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.23ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.4MB in the end (delta: 980.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 722.25ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 42.1MB in the end (delta: 52.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1894.74ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 42.1MB in the beginning and 186.7MB in the end (delta: -144.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.88ms. Allocated memory is still 285.2MB. Free memory was 186.7MB in the beginning and 180.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: 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: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: 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 7 procedures, 250 locations, 71 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: 1.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 44 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 524 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:26:30,445 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