./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i -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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:59:03,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:59:03,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:59:03,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:59:03,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:59:03,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:59:03,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:59:03,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:59:03,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:59:03,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:59:03,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:59:03,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:59:03,954 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:59:03,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:59:03,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:59:03,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:59:03,957 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:59:03,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:59:03,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:59:03,957 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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2025-03-04 06:59:04,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:59:04,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:59:04,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:59:04,212 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:59:04,212 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:59:04,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2025-03-04 06:59:05,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d1e374c/9c99a57dcb8f4fa6b256cc2a85ed43c2/FLAG7c8048347 [2025-03-04 06:59:05,611 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:59:05,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2025-03-04 06:59:05,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d1e374c/9c99a57dcb8f4fa6b256cc2a85ed43c2/FLAG7c8048347 [2025-03-04 06:59:05,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d1e374c/9c99a57dcb8f4fa6b256cc2a85ed43c2 [2025-03-04 06:59:05,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:59:05,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:59:05,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:59:05,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:59:05,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:59:05,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:59:05" (1/1) ... [2025-03-04 06:59:05,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2217ad44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:05, skipping insertion in model container [2025-03-04 06:59:05,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:59:05" (1/1) ... [2025-03-04 06:59:05,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:59:06,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:59:06,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:59:06,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:59:06,327 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:59:06,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06 WrapperNode [2025-03-04 06:59:06,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:59:06,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:59:06,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:59:06,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:59:06,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,360 INFO L138 Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-04 06:59:06,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:59:06,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:59:06,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:59:06,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:59:06,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:59:06,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:59:06,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:59:06,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:59:06,385 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (1/1) ... [2025-03-04 06:59:06,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:59:06,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:59:06,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:59:06,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:59:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:59:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:59:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:59:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:59:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:59:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:59:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 06:59:06,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 06:59:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:59:06,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:59:06,433 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:59:06,526 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:59:06,528 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:59:06,728 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:59:06,729 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:59:06,738 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:59:06,738 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:59:06,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:59:06 BoogieIcfgContainer [2025-03-04 06:59:06,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:59:06,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:59:06,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:59:06,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:59:06,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:59:05" (1/3) ... [2025-03-04 06:59:06,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78256bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:59:06, skipping insertion in model container [2025-03-04 06:59:06,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:06" (2/3) ... [2025-03-04 06:59:06,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78256bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:59:06, skipping insertion in model container [2025-03-04 06:59:06,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:59:06" (3/3) ... [2025-03-04 06:59:06,745 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2025-03-04 06:59:06,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:59:06,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-tid.i that has 2 procedures, 106 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-04 06:59:06,759 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:59:06,811 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:59:06,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 223 flow [2025-03-04 06:59:06,888 INFO L124 PetriNetUnfolderBase]: 2/156 cut-off events. [2025-03-04 06:59:06,892 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:59:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 156 events. 2/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 219 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-03-04 06:59:06,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 108 transitions, 223 flow [2025-03-04 06:59:06,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 108 transitions, 223 flow [2025-03-04 06:59:06,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:59:06,917 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;@2c071dea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:59:06,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 06:59:06,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:59:06,926 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-04 06:59:06,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:59:06,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:06,927 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] [2025-03-04 06:59:06,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:06,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -90682818, now seen corresponding path program 1 times [2025-03-04 06:59:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:06,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140503014] [2025-03-04 06:59:06,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:06,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:07,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:59:07,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:59:07,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:07,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:07,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:07,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140503014] [2025-03-04 06:59:07,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140503014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:07,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:07,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:07,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143980516] [2025-03-04 06:59:07,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:07,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:59:07,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:07,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:59:07,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:59:07,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2025-03-04 06:59:07,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:07,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:07,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2025-03-04 06:59:07,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:07,429 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-03-04 06:59:07,430 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:59:07,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 161 events. 1/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. [2025-03-04 06:59:07,433 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 11 selfloop transitions, 2 changer transitions 6/112 dead transitions. [2025-03-04 06:59:07,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 267 flow [2025-03-04 06:59:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2025-03-04 06:59:07,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2025-03-04 06:59:07,449 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 223 flow. Second operand 6 states and 584 transitions. [2025-03-04 06:59:07,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 267 flow [2025-03-04 06:59:07,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:07,456 INFO L231 Difference]: Finished difference. Result has 118 places, 106 transitions, 237 flow [2025-03-04 06:59:07,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=118, PETRI_TRANSITIONS=106} [2025-03-04 06:59:07,463 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 9 predicate places. [2025-03-04 06:59:07,464 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 106 transitions, 237 flow [2025-03-04 06:59:07,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:07,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:07,464 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] [2025-03-04 06:59:07,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:59:07,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:07,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:07,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1368358570, now seen corresponding path program 1 times [2025-03-04 06:59:07,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:07,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383659168] [2025-03-04 06:59:07,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:07,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 06:59:07,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 06:59:07,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:07,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383659168] [2025-03-04 06:59:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383659168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:07,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191923152] [2025-03-04 06:59:07,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:07,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:07,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:07,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:08,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 108 [2025-03-04 06:59:08,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 106 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:08,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:08,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 108 [2025-03-04 06:59:08,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:08,244 INFO L124 PetriNetUnfolderBase]: 106/500 cut-off events. [2025-03-04 06:59:08,244 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 06:59:08,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 500 events. 106/500 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2433 event pairs, 68 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 692. Up to 240 conditions per place. [2025-03-04 06:59:08,249 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 35 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2025-03-04 06:59:08,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 127 transitions, 393 flow [2025-03-04 06:59:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2025-03-04 06:59:08,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2025-03-04 06:59:08,253 INFO L175 Difference]: Start difference. First operand has 118 places, 106 transitions, 237 flow. Second operand 6 states and 484 transitions. [2025-03-04 06:59:08,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 127 transitions, 393 flow [2025-03-04 06:59:08,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 379 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 06:59:08,259 INFO L231 Difference]: Finished difference. Result has 119 places, 127 transitions, 373 flow [2025-03-04 06:59:08,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=119, PETRI_TRANSITIONS=127} [2025-03-04 06:59:08,259 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2025-03-04 06:59:08,259 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 127 transitions, 373 flow [2025-03-04 06:59:08,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:08,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:08,260 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] [2025-03-04 06:59:08,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:59:08,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:08,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:08,261 INFO L85 PathProgramCache]: Analyzing trace with hash -800255098, now seen corresponding path program 1 times [2025-03-04 06:59:08,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:08,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383852547] [2025-03-04 06:59:08,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:08,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:08,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:59:08,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:59:08,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:08,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383852547] [2025-03-04 06:59:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383852547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:08,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:08,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916309551] [2025-03-04 06:59:08,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:08,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:08,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:08,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:08,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 108 [2025-03-04 06:59:08,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 127 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:08,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:08,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 108 [2025-03-04 06:59:08,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:08,762 INFO L124 PetriNetUnfolderBase]: 125/565 cut-off events. [2025-03-04 06:59:08,763 INFO L125 PetriNetUnfolderBase]: For 108/114 co-relation queries the response was YES. [2025-03-04 06:59:08,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 565 events. 125/565 cut-off events. For 108/114 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2809 event pairs, 55 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 998. Up to 268 conditions per place. [2025-03-04 06:59:08,768 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 52 selfloop transitions, 22 changer transitions 0/148 dead transitions. [2025-03-04 06:59:08,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 595 flow [2025-03-04 06:59:08,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-03-04 06:59:08,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7623456790123457 [2025-03-04 06:59:08,770 INFO L175 Difference]: Start difference. First operand has 119 places, 127 transitions, 373 flow. Second operand 6 states and 494 transitions. [2025-03-04 06:59:08,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 595 flow [2025-03-04 06:59:08,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 595 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:08,776 INFO L231 Difference]: Finished difference. Result has 129 places, 148 transitions, 555 flow [2025-03-04 06:59:08,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=129, PETRI_TRANSITIONS=148} [2025-03-04 06:59:08,777 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places. [2025-03-04 06:59:08,777 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 148 transitions, 555 flow [2025-03-04 06:59:08,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:08,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:08,778 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] [2025-03-04 06:59:08,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:59:08,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:08,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1947607354, now seen corresponding path program 1 times [2025-03-04 06:59:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778549411] [2025-03-04 06:59:08,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:08,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:08,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:59:08,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:59:08,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:08,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:09,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778549411] [2025-03-04 06:59:09,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778549411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:09,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:09,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:09,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765975068] [2025-03-04 06:59:09,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:09,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:09,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:09,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:09,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2025-03-04 06:59:09,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 148 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:09,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:09,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2025-03-04 06:59:09,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:09,330 INFO L124 PetriNetUnfolderBase]: 283/933 cut-off events. [2025-03-04 06:59:09,330 INFO L125 PetriNetUnfolderBase]: For 443/479 co-relation queries the response was YES. [2025-03-04 06:59:09,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 933 events. 283/933 cut-off events. For 443/479 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5285 event pairs, 47 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 2159. Up to 489 conditions per place. [2025-03-04 06:59:09,334 INFO L140 encePairwiseOnDemand]: 85/108 looper letters, 60 selfloop transitions, 90 changer transitions 7/229 dead transitions. [2025-03-04 06:59:09,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 229 transitions, 1163 flow [2025-03-04 06:59:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 557 transitions. [2025-03-04 06:59:09,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595679012345679 [2025-03-04 06:59:09,336 INFO L175 Difference]: Start difference. First operand has 129 places, 148 transitions, 555 flow. Second operand 6 states and 557 transitions. [2025-03-04 06:59:09,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 229 transitions, 1163 flow [2025-03-04 06:59:09,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 229 transitions, 1125 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:09,341 INFO L231 Difference]: Finished difference. Result has 139 places, 222 transitions, 1239 flow [2025-03-04 06:59:09,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1239, PETRI_PLACES=139, PETRI_TRANSITIONS=222} [2025-03-04 06:59:09,342 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 30 predicate places. [2025-03-04 06:59:09,342 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 222 transitions, 1239 flow [2025-03-04 06:59:09,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:09,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:09,342 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] [2025-03-04 06:59:09,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:59:09,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:09,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1593160032, now seen corresponding path program 1 times [2025-03-04 06:59:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:09,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797580289] [2025-03-04 06:59:09,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:09,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:59:09,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:59:09,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:09,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:09,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797580289] [2025-03-04 06:59:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797580289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:09,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401341081] [2025-03-04 06:59:09,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:09,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:09,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:09,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:09,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 108 [2025-03-04 06:59:09,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 222 transitions, 1239 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:09,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:09,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 108 [2025-03-04 06:59:09,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:09,930 INFO L124 PetriNetUnfolderBase]: 282/973 cut-off events. [2025-03-04 06:59:09,930 INFO L125 PetriNetUnfolderBase]: For 1094/1186 co-relation queries the response was YES. [2025-03-04 06:59:09,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 973 events. 282/973 cut-off events. For 1094/1186 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6042 event pairs, 18 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 2922. Up to 400 conditions per place. [2025-03-04 06:59:09,935 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 125 selfloop transitions, 36 changer transitions 0/252 dead transitions. [2025-03-04 06:59:09,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 252 transitions, 1770 flow [2025-03-04 06:59:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2025-03-04 06:59:09,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7808641975308642 [2025-03-04 06:59:09,937 INFO L175 Difference]: Start difference. First operand has 139 places, 222 transitions, 1239 flow. Second operand 6 states and 506 transitions. [2025-03-04 06:59:09,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 252 transitions, 1770 flow [2025-03-04 06:59:09,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 252 transitions, 1734 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:09,948 INFO L231 Difference]: Finished difference. Result has 141 places, 251 transitions, 1589 flow [2025-03-04 06:59:09,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1589, PETRI_PLACES=141, PETRI_TRANSITIONS=251} [2025-03-04 06:59:09,949 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 32 predicate places. [2025-03-04 06:59:09,949 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 251 transitions, 1589 flow [2025-03-04 06:59:09,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:09,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:09,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] [2025-03-04 06:59:09,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:59:09,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1625837938, now seen corresponding path program 1 times [2025-03-04 06:59:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213367825] [2025-03-04 06:59:09,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:09,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:59:09,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:59:09,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:09,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:10,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:10,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213367825] [2025-03-04 06:59:10,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213367825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:10,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:10,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072723294] [2025-03-04 06:59:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:10,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:10,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:10,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:10,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 108 [2025-03-04 06:59:10,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 251 transitions, 1589 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:10,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:10,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 108 [2025-03-04 06:59:10,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:10,519 INFO L124 PetriNetUnfolderBase]: 324/1067 cut-off events. [2025-03-04 06:59:10,519 INFO L125 PetriNetUnfolderBase]: For 1941/2035 co-relation queries the response was YES. [2025-03-04 06:59:10,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1067 events. 324/1067 cut-off events. For 1941/2035 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6747 event pairs, 21 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 3604. Up to 441 conditions per place. [2025-03-04 06:59:10,526 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 136 selfloop transitions, 37 changer transitions 29/291 dead transitions. [2025-03-04 06:59:10,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 291 transitions, 2350 flow [2025-03-04 06:59:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2025-03-04 06:59:10,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395061728395061 [2025-03-04 06:59:10,528 INFO L175 Difference]: Start difference. First operand has 141 places, 251 transitions, 1589 flow. Second operand 6 states and 544 transitions. [2025-03-04 06:59:10,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 291 transitions, 2350 flow [2025-03-04 06:59:10,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 291 transitions, 2192 flow, removed 79 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:10,542 INFO L231 Difference]: Finished difference. Result has 151 places, 262 transitions, 1852 flow [2025-03-04 06:59:10,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1852, PETRI_PLACES=151, PETRI_TRANSITIONS=262} [2025-03-04 06:59:10,543 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 42 predicate places. [2025-03-04 06:59:10,544 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 262 transitions, 1852 flow [2025-03-04 06:59:10,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:10,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:10,544 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] [2025-03-04 06:59:10,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:59:10,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:10,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash -811156847, now seen corresponding path program 1 times [2025-03-04 06:59:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:10,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443696481] [2025-03-04 06:59:10,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:10,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:59:10,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:59:10,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:10,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:10,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:10,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443696481] [2025-03-04 06:59:10,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443696481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:10,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:10,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 06:59:10,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108917793] [2025-03-04 06:59:10,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:10,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 06:59:10,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:10,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 06:59:10,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 06:59:11,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 108 [2025-03-04 06:59:11,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 262 transitions, 1852 flow. Second operand has 14 states, 14 states have (on average 65.85714285714286) internal successors, (922), 14 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:11,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:11,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 108 [2025-03-04 06:59:11,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:12,616 INFO L124 PetriNetUnfolderBase]: 405/1210 cut-off events. [2025-03-04 06:59:12,616 INFO L125 PetriNetUnfolderBase]: For 2541/2592 co-relation queries the response was YES. [2025-03-04 06:59:12,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1210 events. 405/1210 cut-off events. For 2541/2592 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7658 event pairs, 23 based on Foata normal form. 46/1252 useless extension candidates. Maximal degree in co-relation 4626. Up to 329 conditions per place. [2025-03-04 06:59:12,623 INFO L140 encePairwiseOnDemand]: 83/108 looper letters, 206 selfloop transitions, 166 changer transitions 0/426 dead transitions. [2025-03-04 06:59:12,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 426 transitions, 3726 flow [2025-03-04 06:59:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 06:59:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 06:59:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2510 transitions. [2025-03-04 06:59:12,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6455761316872428 [2025-03-04 06:59:12,628 INFO L175 Difference]: Start difference. First operand has 151 places, 262 transitions, 1852 flow. Second operand 36 states and 2510 transitions. [2025-03-04 06:59:12,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 426 transitions, 3726 flow [2025-03-04 06:59:12,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 426 transitions, 3642 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:12,647 INFO L231 Difference]: Finished difference. Result has 183 places, 330 transitions, 2820 flow [2025-03-04 06:59:12,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2820, PETRI_PLACES=183, PETRI_TRANSITIONS=330} [2025-03-04 06:59:12,648 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 74 predicate places. [2025-03-04 06:59:12,648 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 330 transitions, 2820 flow [2025-03-04 06:59:12,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 65.85714285714286) internal successors, (922), 14 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:12,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:12,648 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] [2025-03-04 06:59:12,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:59:12,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:12,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1629204000, now seen corresponding path program 1 times [2025-03-04 06:59:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:12,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-03-04 06:59:12,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:12,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:12,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:59:12,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:59:12,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:12,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:13,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-03-04 06:59:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949215757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 06:59:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200605007] [2025-03-04 06:59:13,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:13,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 06:59:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:13,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 06:59:13,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 06:59:13,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 108 [2025-03-04 06:59:13,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 330 transitions, 2820 flow. Second operand has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:13,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:13,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 108 [2025-03-04 06:59:13,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:14,398 INFO L124 PetriNetUnfolderBase]: 402/1290 cut-off events. [2025-03-04 06:59:14,399 INFO L125 PetriNetUnfolderBase]: For 4824/4854 co-relation queries the response was YES. [2025-03-04 06:59:14,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5744 conditions, 1290 events. 402/1290 cut-off events. For 4824/4854 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8460 event pairs, 13 based on Foata normal form. 13/1298 useless extension candidates. Maximal degree in co-relation 5596. Up to 343 conditions per place. [2025-03-04 06:59:14,409 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 253 selfloop transitions, 73 changer transitions 0/418 dead transitions. [2025-03-04 06:59:14,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 418 transitions, 4401 flow [2025-03-04 06:59:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 06:59:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 06:59:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1808 transitions. [2025-03-04 06:59:14,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6438746438746439 [2025-03-04 06:59:14,413 INFO L175 Difference]: Start difference. First operand has 183 places, 330 transitions, 2820 flow. Second operand 26 states and 1808 transitions. [2025-03-04 06:59:14,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 418 transitions, 4401 flow [2025-03-04 06:59:14,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 418 transitions, 4147 flow, removed 100 selfloop flow, removed 8 redundant places. [2025-03-04 06:59:14,449 INFO L231 Difference]: Finished difference. Result has 205 places, 355 transitions, 3066 flow [2025-03-04 06:59:14,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3066, PETRI_PLACES=205, PETRI_TRANSITIONS=355} [2025-03-04 06:59:14,452 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 96 predicate places. [2025-03-04 06:59:14,452 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 355 transitions, 3066 flow [2025-03-04 06:59:14,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:14,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:14,453 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] [2025-03-04 06:59:14,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:59:14,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:14,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1774847060, now seen corresponding path program 2 times [2025-03-04 06:59:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603698297] [2025-03-04 06:59:14,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:59:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:14,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:59:14,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:59:14,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:59:14,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:14,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:14,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603698297] [2025-03-04 06:59:14,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603698297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:14,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:14,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 06:59:14,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196924727] [2025-03-04 06:59:14,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:14,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 06:59:14,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:14,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 06:59:14,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 06:59:15,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 108 [2025-03-04 06:59:15,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 355 transitions, 3066 flow. Second operand has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:15,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:15,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 108 [2025-03-04 06:59:15,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:16,044 INFO L124 PetriNetUnfolderBase]: 493/1582 cut-off events. [2025-03-04 06:59:16,044 INFO L125 PetriNetUnfolderBase]: For 6112/6219 co-relation queries the response was YES. [2025-03-04 06:59:16,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7071 conditions, 1582 events. 493/1582 cut-off events. For 6112/6219 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11355 event pairs, 12 based on Foata normal form. 23/1593 useless extension candidates. Maximal degree in co-relation 6917. Up to 446 conditions per place. [2025-03-04 06:59:16,055 INFO L140 encePairwiseOnDemand]: 88/108 looper letters, 245 selfloop transitions, 95 changer transitions 0/432 dead transitions. [2025-03-04 06:59:16,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 432 transitions, 4576 flow [2025-03-04 06:59:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 06:59:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 06:59:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1538 transitions. [2025-03-04 06:59:16,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6473063973063973 [2025-03-04 06:59:16,061 INFO L175 Difference]: Start difference. First operand has 205 places, 355 transitions, 3066 flow. Second operand 22 states and 1538 transitions. [2025-03-04 06:59:16,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 432 transitions, 4576 flow [2025-03-04 06:59:16,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 432 transitions, 4507 flow, removed 0 selfloop flow, removed 16 redundant places. [2025-03-04 06:59:16,093 INFO L231 Difference]: Finished difference. Result has 216 places, 386 transitions, 3741 flow [2025-03-04 06:59:16,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2997, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3741, PETRI_PLACES=216, PETRI_TRANSITIONS=386} [2025-03-04 06:59:16,095 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 107 predicate places. [2025-03-04 06:59:16,095 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 386 transitions, 3741 flow [2025-03-04 06:59:16,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:16,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:16,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:16,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:59:16,095 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:59:16,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1312682788, now seen corresponding path program 3 times [2025-03-04 06:59:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:16,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541330115] [2025-03-04 06:59:16,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:59:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:16,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 2 equivalence classes. [2025-03-04 06:59:16,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:59:16,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 06:59:16,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541330115] [2025-03-04 06:59:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541330115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:59:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098056896] [2025-03-04 06:59:16,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:59:16,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:59:16,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:59:16,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:59:16,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:59:16,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 2 equivalence classes. [2025-03-04 06:59:16,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:59:16,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 06:59:16,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:16,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 06:59:16,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:59:16,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:59:16,876 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:59:16,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 06:59:17,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:59:17,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 06:59:17,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 06:59:17,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-04 06:59:17,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2025-03-04 06:59:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:17,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:59:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098056896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:59:43,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:59:43,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 39 [2025-03-04 06:59:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364927895] [2025-03-04 06:59:43,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:59:43,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 06:59:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:43,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 06:59:43,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1343, Unknown=6, NotChecked=0, Total=1560 [2025-03-04 06:59:47,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:59:51,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:59:55,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:59:59,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:03,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:08,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:12,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:16,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:20,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:25,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:27,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:32,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:35,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:39,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:43,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:45,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]