./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/chl-collitem-symm.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 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:11:23,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:11:23,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:11:23,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:11:23,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:11:23,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:11:23,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:11:23,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:11:23,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:11:23,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:11:23,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:11:23,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:11:23,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:11:23,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:11:23,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:11:23,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:11:23,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:11:23,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:11:23,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:11:23,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:11:23,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:11:23,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:23,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:11:23,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:11:23,477 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:11:23,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:11:23,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:11:23,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:11:23,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:11:23,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:11:23,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:11:23,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:11:23,477 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 -> 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c [2025-03-17 11:11:23,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:11:23,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:11:23,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:11:23,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:11:23,720 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:11:23,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-03-17 11:11:24,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a70b40a9b/1736139fa0324a6db752084c2174eac2/FLAGbc7dc0523 [2025-03-17 11:11:24,999 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:11:25,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-03-17 11:11:25,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a70b40a9b/1736139fa0324a6db752084c2174eac2/FLAGbc7dc0523 [2025-03-17 11:11:25,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a70b40a9b/1736139fa0324a6db752084c2174eac2 [2025-03-17 11:11:25,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:11:25,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:11:25,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:25,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:11:25,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:11:25,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6350a18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25, skipping insertion in model container [2025-03-17 11:11:25,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:11:25,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:25,527 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:11:25,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:25,566 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:11:25,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25 WrapperNode [2025-03-17 11:11:25,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:25,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:25,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:11:25,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:11:25,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,607 INFO L138 Inliner]: procedures = 21, calls = 26, calls flagged for inlining = 16, calls inlined = 30, statements flattened = 405 [2025-03-17 11:11:25,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:25,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:11:25,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:11:25,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:11:25,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:11:25,640 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:11:25,640 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:11:25,640 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:11:25,641 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (1/1) ... [2025-03-17 11:11:25,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:25,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:25,675 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-17 11:11:25,682 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-17 11:11:25,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:11:25,697 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:11:25,697 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:11:25,697 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:11:25,697 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:11:25,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:11:25,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:11:25,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:11:25,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:11:25,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:11:25,699 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:11:25,775 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:11:25,777 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:11:26,226 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:11:26,226 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:11:26,606 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:11:26,607 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:11:26,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:26 BoogieIcfgContainer [2025-03-17 11:11:26,607 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:11:26,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:11:26,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:11:26,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:11:26,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:11:25" (1/3) ... [2025-03-17 11:11:26,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c851006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:26, skipping insertion in model container [2025-03-17 11:11:26,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:25" (2/3) ... [2025-03-17 11:11:26,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c851006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:26, skipping insertion in model container [2025-03-17 11:11:26,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:26" (3/3) ... [2025-03-17 11:11:26,615 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-symm.wvr.c [2025-03-17 11:11:26,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:11:26,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-symm.wvr.c that has 3 procedures, 230 locations, 1 initial locations, 0 loop locations, and 52 error locations. [2025-03-17 11:11:26,629 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:11:26,700 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:11:26,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 235 transitions, 484 flow [2025-03-17 11:11:26,801 INFO L124 PetriNetUnfolderBase]: 6/233 cut-off events. [2025-03-17 11:11:26,803 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:26,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 233 events. 6/233 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 311 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2025-03-17 11:11:26,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 235 transitions, 484 flow [2025-03-17 11:11:26,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 213 transitions, 438 flow [2025-03-17 11:11:26,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:11:26,826 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;@8e50f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:11:26,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-03-17 11:11:26,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:11:26,836 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-17 11:11:26,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:11:26,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:26,836 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] [2025-03-17 11:11:26,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:26,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:26,842 INFO L85 PathProgramCache]: Analyzing trace with hash -14057530, now seen corresponding path program 1 times [2025-03-17 11:11:26,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:26,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273668462] [2025-03-17 11:11:26,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:26,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:26,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:11:26,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:11:26,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:26,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:26,966 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-17 11:11:26,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273668462] [2025-03-17 11:11:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273668462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:26,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:26,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273464240] [2025-03-17 11:11:26,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:26,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:26,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:26,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:27,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-03-17 11:11:27,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 213 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-03-17 11:11:27,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,112 INFO L124 PetriNetUnfolderBase]: 5/184 cut-off events. [2025-03-17 11:11:27,112 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 11:11:27,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 184 events. 5/184 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 3 based on Foata normal form. 2/167 useless extension candidates. Maximal degree in co-relation 48. Up to 16 conditions per place. [2025-03-17 11:11:27,115 INFO L140 encePairwiseOnDemand]: 194/235 looper letters, 9 selfloop transitions, 2 changer transitions 2/174 dead transitions. [2025-03-17 11:11:27,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 174 transitions, 382 flow [2025-03-17 11:11:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2025-03-17 11:11:27,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8453900709219858 [2025-03-17 11:11:27,128 INFO L175 Difference]: Start difference. First operand has 216 places, 213 transitions, 438 flow. Second operand 3 states and 596 transitions. [2025-03-17 11:11:27,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 174 transitions, 382 flow [2025-03-17 11:11:27,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 174 transitions, 374 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:11:27,138 INFO L231 Difference]: Finished difference. Result has 177 places, 172 transitions, 352 flow [2025-03-17 11:11:27,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=177, PETRI_TRANSITIONS=172} [2025-03-17 11:11:27,145 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -39 predicate places. [2025-03-17 11:11:27,145 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 172 transitions, 352 flow [2025-03-17 11:11:27,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,146 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] [2025-03-17 11:11:27,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:11:27,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2079336682, now seen corresponding path program 1 times [2025-03-17 11:11:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188492706] [2025-03-17 11:11:27,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:11:27,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:11:27,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:27,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188492706] [2025-03-17 11:11:27,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188492706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:27,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:27,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:27,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352202260] [2025-03-17 11:11:27,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:27,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:27,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-03-17 11:11:27,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 172 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-03-17 11:11:27,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,271 INFO L124 PetriNetUnfolderBase]: 5/181 cut-off events. [2025-03-17 11:11:27,271 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:27,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 181 events. 5/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 172. Up to 16 conditions per place. [2025-03-17 11:11:27,272 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2025-03-17 11:11:27,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 171 transitions, 372 flow [2025-03-17 11:11:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-03-17 11:11:27,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-03-17 11:11:27,274 INFO L175 Difference]: Start difference. First operand has 177 places, 172 transitions, 352 flow. Second operand 3 states and 558 transitions. [2025-03-17 11:11:27,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 171 transitions, 372 flow [2025-03-17 11:11:27,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 171 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:27,277 INFO L231 Difference]: Finished difference. Result has 174 places, 171 transitions, 350 flow [2025-03-17 11:11:27,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=174, PETRI_TRANSITIONS=171} [2025-03-17 11:11:27,278 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -42 predicate places. [2025-03-17 11:11:27,278 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 171 transitions, 350 flow [2025-03-17 11:11:27,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,279 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-17 11:11:27,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:11:27,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:27,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1323266053, now seen corresponding path program 1 times [2025-03-17 11:11:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381709480] [2025-03-17 11:11:27,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:11:27,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:11:27,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,327 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-17 11:11:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381709480] [2025-03-17 11:11:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381709480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903618386] [2025-03-17 11:11:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:27,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:27,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-03-17 11:11:27,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 171 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-03-17 11:11:27,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,371 INFO L124 PetriNetUnfolderBase]: 5/180 cut-off events. [2025-03-17 11:11:27,371 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:27,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 180 events. 5/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 163. Up to 16 conditions per place. [2025-03-17 11:11:27,372 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-03-17 11:11:27,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 170 transitions, 370 flow [2025-03-17 11:11:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-03-17 11:11:27,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-03-17 11:11:27,373 INFO L175 Difference]: Start difference. First operand has 174 places, 171 transitions, 350 flow. Second operand 3 states and 558 transitions. [2025-03-17 11:11:27,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 170 transitions, 370 flow [2025-03-17 11:11:27,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 170 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:27,377 INFO L231 Difference]: Finished difference. Result has 173 places, 170 transitions, 348 flow [2025-03-17 11:11:27,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=173, PETRI_TRANSITIONS=170} [2025-03-17 11:11:27,378 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -43 predicate places. [2025-03-17 11:11:27,378 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 170 transitions, 348 flow [2025-03-17 11:11:27,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,378 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] [2025-03-17 11:11:27,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:11:27,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:27,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash 669634816, now seen corresponding path program 1 times [2025-03-17 11:11:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870391619] [2025-03-17 11:11:27,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:11:27,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:11:27,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,430 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-17 11:11:27,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870391619] [2025-03-17 11:11:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870391619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:27,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860508486] [2025-03-17 11:11:27,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:27,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:27,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-03-17 11:11:27,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-03-17 11:11:27,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,489 INFO L124 PetriNetUnfolderBase]: 5/179 cut-off events. [2025-03-17 11:11:27,489 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:27,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 179 events. 5/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 154. Up to 16 conditions per place. [2025-03-17 11:11:27,490 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-03-17 11:11:27,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 169 transitions, 368 flow [2025-03-17 11:11:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-03-17 11:11:27,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-03-17 11:11:27,493 INFO L175 Difference]: Start difference. First operand has 173 places, 170 transitions, 348 flow. Second operand 3 states and 558 transitions. [2025-03-17 11:11:27,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 169 transitions, 368 flow [2025-03-17 11:11:27,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 169 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:27,497 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 346 flow [2025-03-17 11:11:27,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2025-03-17 11:11:27,498 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -44 predicate places. [2025-03-17 11:11:27,498 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 346 flow [2025-03-17 11:11:27,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,499 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] [2025-03-17 11:11:27,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:11:27,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:27,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash 609799095, now seen corresponding path program 1 times [2025-03-17 11:11:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715033384] [2025-03-17 11:11:27,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:11:27,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:11:27,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715033384] [2025-03-17 11:11:27,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715033384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:27,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:27,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173306969] [2025-03-17 11:11:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:27,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:27,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-03-17 11:11:27,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-03-17 11:11:27,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,606 INFO L124 PetriNetUnfolderBase]: 5/178 cut-off events. [2025-03-17 11:11:27,607 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:27,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 178 events. 5/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 145. Up to 16 conditions per place. [2025-03-17 11:11:27,607 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2025-03-17 11:11:27,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 366 flow [2025-03-17 11:11:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-03-17 11:11:27,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-03-17 11:11:27,611 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 346 flow. Second operand 3 states and 558 transitions. [2025-03-17 11:11:27,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 366 flow [2025-03-17 11:11:27,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:27,614 INFO L231 Difference]: Finished difference. Result has 171 places, 168 transitions, 344 flow [2025-03-17 11:11:27,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2025-03-17 11:11:27,616 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -45 predicate places. [2025-03-17 11:11:27,616 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 344 flow [2025-03-17 11:11:27,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,618 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] [2025-03-17 11:11:27,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:11:27,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:27,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1818415859, now seen corresponding path program 1 times [2025-03-17 11:11:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795129405] [2025-03-17 11:11:27,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 11:11:27,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 11:11:27,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,676 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-17 11:11:27,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795129405] [2025-03-17 11:11:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795129405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:27,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:27,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996633495] [2025-03-17 11:11:27,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:27,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:27,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-03-17 11:11:27,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-03-17 11:11:27,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,720 INFO L124 PetriNetUnfolderBase]: 5/177 cut-off events. [2025-03-17 11:11:27,721 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:27,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 177 events. 5/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 136. Up to 16 conditions per place. [2025-03-17 11:11:27,722 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-03-17 11:11:27,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 167 transitions, 364 flow [2025-03-17 11:11:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-03-17 11:11:27,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-03-17 11:11:27,723 INFO L175 Difference]: Start difference. First operand has 171 places, 168 transitions, 344 flow. Second operand 3 states and 558 transitions. [2025-03-17 11:11:27,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 167 transitions, 364 flow [2025-03-17 11:11:27,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 167 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:27,725 INFO L231 Difference]: Finished difference. Result has 170 places, 167 transitions, 342 flow [2025-03-17 11:11:27,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=170, PETRI_TRANSITIONS=167} [2025-03-17 11:11:27,728 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -46 predicate places. [2025-03-17 11:11:27,728 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 167 transitions, 342 flow [2025-03-17 11:11:27,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:27,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:11:27,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:27,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1368068176, now seen corresponding path program 1 times [2025-03-17 11:11:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729674612] [2025-03-17 11:11:27,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 11:11:27,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 11:11:27,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,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-17 11:11:27,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729674612] [2025-03-17 11:11:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729674612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:27,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596153582] [2025-03-17 11:11:27,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:27,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:27,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:27,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-03-17 11:11:27,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-03-17 11:11:27,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,831 INFO L124 PetriNetUnfolderBase]: 5/176 cut-off events. [2025-03-17 11:11:27,832 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:27,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 176 events. 5/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 127. Up to 16 conditions per place. [2025-03-17 11:11:27,832 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-17 11:11:27,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 166 transitions, 362 flow [2025-03-17 11:11:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-03-17 11:11:27,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-03-17 11:11:27,834 INFO L175 Difference]: Start difference. First operand has 170 places, 167 transitions, 342 flow. Second operand 3 states and 558 transitions. [2025-03-17 11:11:27,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 166 transitions, 362 flow [2025-03-17 11:11:27,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:27,836 INFO L231 Difference]: Finished difference. Result has 169 places, 166 transitions, 340 flow [2025-03-17 11:11:27,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=169, PETRI_TRANSITIONS=166} [2025-03-17 11:11:27,837 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -47 predicate places. [2025-03-17 11:11:27,837 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 166 transitions, 340 flow [2025-03-17 11:11:27,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,837 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] [2025-03-17 11:11:27,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:11:27,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:27,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash -709513163, now seen corresponding path program 1 times [2025-03-17 11:11:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015444868] [2025-03-17 11:11:27,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:11:27,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:11:27,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,891 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-17 11:11:27,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015444868] [2025-03-17 11:11:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015444868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:27,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754960920] [2025-03-17 11:11:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:27,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:27,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 235 [2025-03-17 11:11:27,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 235 [2025-03-17 11:11:27,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,939 INFO L124 PetriNetUnfolderBase]: 5/175 cut-off events. [2025-03-17 11:11:27,940 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:27,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 175 events. 5/175 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 118. Up to 16 conditions per place. [2025-03-17 11:11:27,940 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2025-03-17 11:11:27,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 360 flow [2025-03-17 11:11:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-03-17 11:11:27,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914893617021277 [2025-03-17 11:11:27,942 INFO L175 Difference]: Start difference. First operand has 169 places, 166 transitions, 340 flow. Second operand 3 states and 558 transitions. [2025-03-17 11:11:27,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 360 flow [2025-03-17 11:11:27,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:27,944 INFO L231 Difference]: Finished difference. Result has 168 places, 165 transitions, 338 flow [2025-03-17 11:11:27,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=165} [2025-03-17 11:11:27,949 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -48 predicate places. [2025-03-17 11:11:27,949 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 165 transitions, 338 flow [2025-03-17 11:11:27,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-17 11:11:27,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,950 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] [2025-03-17 11:11:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:11:27,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:27,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1690230861, now seen corresponding path program 1 times [2025-03-17 11:11:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54314596] [2025-03-17 11:11:27,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 11:11:27,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 11:11:27,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,005 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-17 11:11:28,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54314596] [2025-03-17 11:11:28,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54314596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:28,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502797245] [2025-03-17 11:11:28,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:28,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:28,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 235 [2025-03-17 11:11:28,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 165 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-17 11:11:28,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 235 [2025-03-17 11:11:28,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,057 INFO L124 PetriNetUnfolderBase]: 5/174 cut-off events. [2025-03-17 11:11:28,057 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:28,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 174 events. 5/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 112. Up to 19 conditions per place. [2025-03-17 11:11:28,057 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-03-17 11:11:28,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 364 flow [2025-03-17 11:11:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2025-03-17 11:11:28,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7829787234042553 [2025-03-17 11:11:28,059 INFO L175 Difference]: Start difference. First operand has 168 places, 165 transitions, 338 flow. Second operand 3 states and 552 transitions. [2025-03-17 11:11:28,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 364 flow [2025-03-17 11:11:28,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:28,061 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 336 flow [2025-03-17 11:11:28,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2025-03-17 11:11:28,062 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -49 predicate places. [2025-03-17 11:11:28,062 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 336 flow [2025-03-17 11:11:28,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-17 11:11:28,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,062 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] [2025-03-17 11:11:28,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:11:28,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:28,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2037198969, now seen corresponding path program 1 times [2025-03-17 11:11:28,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940228789] [2025-03-17 11:11:28,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:28,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 11:11:28,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:11:28,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:28,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,101 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-17 11:11:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940228789] [2025-03-17 11:11:28,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940228789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375070636] [2025-03-17 11:11:28,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:28,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:28,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 235 [2025-03-17 11:11:28,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-17 11:11:28,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 235 [2025-03-17 11:11:28,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,153 INFO L124 PetriNetUnfolderBase]: 5/173 cut-off events. [2025-03-17 11:11:28,153 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:28,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 173 events. 5/173 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 103. Up to 19 conditions per place. [2025-03-17 11:11:28,154 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 12 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-03-17 11:11:28,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 362 flow [2025-03-17 11:11:28,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2025-03-17 11:11:28,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7829787234042553 [2025-03-17 11:11:28,156 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 336 flow. Second operand 3 states and 552 transitions. [2025-03-17 11:11:28,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 362 flow [2025-03-17 11:11:28,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 163 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:28,158 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 334 flow [2025-03-17 11:11:28,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2025-03-17 11:11:28,158 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -50 predicate places. [2025-03-17 11:11:28,158 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 334 flow [2025-03-17 11:11:28,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-17 11:11:28,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:28,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:11:28,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:28,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1007625268, now seen corresponding path program 1 times [2025-03-17 11:11:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754322481] [2025-03-17 11:11:28,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 11:11:28,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 11:11:28,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:28,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:28,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754322481] [2025-03-17 11:11:28,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754322481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296580269] [2025-03-17 11:11:28,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:28,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:28,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:28,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 235 [2025-03-17 11:11:28,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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-17 11:11:28,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 235 [2025-03-17 11:11:28,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,327 INFO L124 PetriNetUnfolderBase]: 5/170 cut-off events. [2025-03-17 11:11:28,327 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:28,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 170 events. 5/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 3 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 91. Up to 14 conditions per place. [2025-03-17 11:11:28,332 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 12 selfloop transitions, 1 changer transitions 0/160 dead transitions. [2025-03-17 11:11:28,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 160 transitions, 354 flow [2025-03-17 11:11:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2025-03-17 11:11:28,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843971631205674 [2025-03-17 11:11:28,333 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 334 flow. Second operand 3 states and 553 transitions. [2025-03-17 11:11:28,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 160 transitions, 354 flow [2025-03-17 11:11:28,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:28,336 INFO L231 Difference]: Finished difference. Result has 163 places, 160 transitions, 326 flow [2025-03-17 11:11:28,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=163, PETRI_TRANSITIONS=160} [2025-03-17 11:11:28,336 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -53 predicate places. [2025-03-17 11:11:28,336 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 160 transitions, 326 flow [2025-03-17 11:11:28,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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-17 11:11:28,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:28,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:11:28,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2025-03-17 11:11:28,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1147884172, now seen corresponding path program 1 times [2025-03-17 11:11:28,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381450872] [2025-03-17 11:11:28,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:28,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 11:11:28,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 11:11:28,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:28,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,412 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-17 11:11:28,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381450872] [2025-03-17 11:11:28,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381450872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153157058] [2025-03-17 11:11:28,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:28,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:28,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:28,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 235 [2025-03-17 11:11:28,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 160 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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-17 11:11:28,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 235 [2025-03-17 11:11:28,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,461 INFO L124 PetriNetUnfolderBase]: 6/192 cut-off events. [2025-03-17 11:11:28,462 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:28,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 192 events. 6/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 3 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2025-03-17 11:11:28,463 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 0 selfloop transitions, 0 changer transitions 159/159 dead transitions. [2025-03-17 11:11:28,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 159 transitions, 352 flow [2025-03-17 11:11:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2025-03-17 11:11:28,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7858156028368795 [2025-03-17 11:11:28,465 INFO L175 Difference]: Start difference. First operand has 163 places, 160 transitions, 326 flow. Second operand 3 states and 554 transitions. [2025-03-17 11:11:28,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 159 transitions, 352 flow [2025-03-17 11:11:28,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:28,467 INFO L231 Difference]: Finished difference. Result has 161 places, 0 transitions, 0 flow [2025-03-17 11:11:28,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=161, PETRI_TRANSITIONS=0} [2025-03-17 11:11:28,468 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -55 predicate places. [2025-03-17 11:11:28,468 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 0 transitions, 0 flow [2025-03-17 11:11:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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-17 11:11:28,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (89 of 90 remaining) [2025-03-17 11:11:28,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (88 of 90 remaining) [2025-03-17 11:11:28,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (87 of 90 remaining) [2025-03-17 11:11:28,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (86 of 90 remaining) [2025-03-17 11:11:28,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (85 of 90 remaining) [2025-03-17 11:11:28,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (84 of 90 remaining) [2025-03-17 11:11:28,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (83 of 90 remaining) [2025-03-17 11:11:28,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 90 remaining) [2025-03-17 11:11:28,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (74 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (73 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (71 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (70 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (69 of 90 remaining) [2025-03-17 11:11:28,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (68 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (67 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (66 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (64 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (63 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (58 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (56 of 90 remaining) [2025-03-17 11:11:28,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (55 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (53 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (52 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (51 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (50 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (49 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (48 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (47 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (45 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (44 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (43 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (39 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (35 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (34 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (33 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (32 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (31 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (30 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (29 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (28 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (27 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 90 remaining) [2025-03-17 11:11:28,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 90 remaining) [2025-03-17 11:11:28,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 90 remaining) [2025-03-17 11:11:28,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 90 remaining) [2025-03-17 11:11:28,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 90 remaining) [2025-03-17 11:11:28,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 90 remaining) [2025-03-17 11:11:28,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 90 remaining) [2025-03-17 11:11:28,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:11:28,478 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:28,481 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:11:28,481 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:11:28,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:11:28 BasicIcfg [2025-03-17 11:11:28,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:11:28,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:11:28,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:11:28,487 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:11:28,487 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:26" (3/4) ... [2025-03-17 11:11:28,488 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:11:28,491 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:11:28,491 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:11:28,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 11:11:28,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:11:28,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:11:28,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:11:28,556 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:11:28,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:11:28,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:11:28,557 INFO L158 Benchmark]: Toolchain (without parser) took 3182.74ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 107.4MB in the beginning and 133.5MB in the end (delta: -26.1MB). Peak memory consumption was 169.5MB. Max. memory is 16.1GB. [2025-03-17 11:11:28,557 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:28,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.59ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:28,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.31ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:28,558 INFO L158 Benchmark]: Boogie Preprocessor took 31.48ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:28,558 INFO L158 Benchmark]: IcfgBuilder took 967.53ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 83.2MB in the end (delta: 7.2MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2025-03-17 11:11:28,558 INFO L158 Benchmark]: TraceAbstraction took 1877.58ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 82.5MB in the beginning and 140.7MB in the end (delta: -58.2MB). Peak memory consumption was 148.7MB. Max. memory is 16.1GB. [2025-03-17 11:11:28,558 INFO L158 Benchmark]: Witness Printer took 69.77ms. Allocated memory is still 343.9MB. Free memory was 140.7MB in the beginning and 133.5MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:28,559 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.13ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.59ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.31ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.48ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 967.53ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 83.2MB in the end (delta: 7.2MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1877.58ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 82.5MB in the beginning and 140.7MB in the end (delta: -58.2MB). Peak memory consumption was 148.7MB. Max. memory is 16.1GB. * Witness Printer took 69.77ms. Allocated memory is still 343.9MB. Free memory was 140.7MB in the beginning and 133.5MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: 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: 46]: 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: 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: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 278 locations, 283 edges, 90 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: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 23 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=0, InterpolantAutomatonStates: 36, 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.5s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 860 ConstructedInterpolants, 0 QuantifiedInterpolants, 884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 52 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:11:28,571 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