./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:39:30,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:39:30,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:39:30,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:39:30,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:39:30,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:39:30,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:39:30,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:39:30,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:39:30,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:39:30,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:39:30,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:39:30,252 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:39:30,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:39:30,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:39:30,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:39:30,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:30,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:30,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:30,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:39:30,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:30,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:30,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:30,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:39:30,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:39:30,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:39:30,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:39:30,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:39:30,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:39:30,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:39:30,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:39:30,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:39:30,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:39:30,257 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-jdk21/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 -> 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 [2025-01-09 21:39:30,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:39:30,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:39:30,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:39:30,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:39:30,567 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:39:30,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2025-01-09 21:39:31,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a38f62f6c/dcc91d0572764efda3fdce229e300fe6/FLAG0149195f5 [2025-01-09 21:39:32,286 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:39:32,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2025-01-09 21:39:32,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a38f62f6c/dcc91d0572764efda3fdce229e300fe6/FLAG0149195f5 [2025-01-09 21:39:32,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a38f62f6c/dcc91d0572764efda3fdce229e300fe6 [2025-01-09 21:39:32,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:39:32,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:39:32,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:32,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:39:32,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:39:32,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:32" (1/1) ... [2025-01-09 21:39:32,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390e58be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:32, skipping insertion in model container [2025-01-09 21:39:32,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:32" (1/1) ... [2025-01-09 21:39:32,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:39:32,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:32,945 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:39:32,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:33,035 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:39:33,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33 WrapperNode [2025-01-09 21:39:33,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:33,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:33,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:39:33,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:39:33,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,075 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-01-09 21:39:33,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:33,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:39:33,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:39:33,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:39:33,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:39:33,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:39:33,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:39:33,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:39:33,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (1/1) ... [2025-01-09 21:39:33,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:33,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:39:33,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:39:33,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:39:33,167 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:39:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:39:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:39:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:39:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:39:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:39:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:39:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:39:33,170 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:39:33,287 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:39:33,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:39:33,634 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:39:33,634 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:39:33,666 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:39:33,666 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:39:33,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:33 BoogieIcfgContainer [2025-01-09 21:39:33,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:39:33,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:39:33,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:39:33,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:39:33,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:32" (1/3) ... [2025-01-09 21:39:33,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14795b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:33, skipping insertion in model container [2025-01-09 21:39:33,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:33" (2/3) ... [2025-01-09 21:39:33,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14795b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:33, skipping insertion in model container [2025-01-09 21:39:33,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:33" (3/3) ... [2025-01-09 21:39:33,674 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer.i [2025-01-09 21:39:33,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:39:33,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer.i that has 2 procedures, 230 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-01-09 21:39:33,687 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:39:33,748 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:33,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 233 transitions, 470 flow [2025-01-09 21:39:33,911 INFO L124 PetriNetUnfolderBase]: 5/274 cut-off events. [2025-01-09 21:39:33,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:33,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 5/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 233 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 192. Up to 4 conditions per place. [2025-01-09 21:39:33,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 233 transitions, 470 flow [2025-01-09 21:39:33,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 233 transitions, 470 flow [2025-01-09 21:39:33,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:33,947 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;@1b722036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:33,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 21:39:33,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:33,991 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-01-09 21:39:33,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:33,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:33,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:33,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:33,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash -891270066, now seen corresponding path program 1 times [2025-01-09 21:39:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:34,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019321548] [2025-01-09 21:39:34,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:34,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:34,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:39:34,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:39:34,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:34,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019321548] [2025-01-09 21:39:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019321548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:34,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:34,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331367917] [2025-01-09 21:39:34,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:34,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:34,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:34,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:34,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:34,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-01-09 21:39:34,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 233 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-01-09 21:39:34,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:34,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-01-09 21:39:34,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:34,763 INFO L124 PetriNetUnfolderBase]: 98/708 cut-off events. [2025-01-09 21:39:34,763 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:39:34,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 708 events. 98/708 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3309 event pairs, 33 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 731. Up to 138 conditions per place. [2025-01-09 21:39:34,773 INFO L140 encePairwiseOnDemand]: 220/233 looper letters, 32 selfloop transitions, 8 changer transitions 1/249 dead transitions. [2025-01-09 21:39:34,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 249 transitions, 582 flow [2025-01-09 21:39:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-01-09 21:39:34,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628040057224606 [2025-01-09 21:39:34,794 INFO L175 Difference]: Start difference. First operand has 233 places, 233 transitions, 470 flow. Second operand 3 states and 673 transitions. [2025-01-09 21:39:34,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 249 transitions, 582 flow [2025-01-09 21:39:34,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:34,806 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 534 flow [2025-01-09 21:39:34,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2025-01-09 21:39:34,812 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2025-01-09 21:39:34,812 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 534 flow [2025-01-09 21:39:34,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-01-09 21:39:34,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:34,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:34,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:39:34,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:34,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1322353355, now seen corresponding path program 1 times [2025-01-09 21:39:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:34,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479786578] [2025-01-09 21:39:34,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:34,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:39:34,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:39:34,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:34,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:34,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:34,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479786578] [2025-01-09 21:39:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479786578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:34,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:34,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315274556] [2025-01-09 21:39:34,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:34,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:34,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:34,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:35,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-01-09 21:39:35,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-01-09 21:39:35,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:35,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-01-09 21:39:35,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:35,237 INFO L124 PetriNetUnfolderBase]: 114/845 cut-off events. [2025-01-09 21:39:35,238 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2025-01-09 21:39:35,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 845 events. 114/845 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4457 event pairs, 72 based on Foata normal form. 4/793 useless extension candidates. Maximal degree in co-relation 1058. Up to 226 conditions per place. [2025-01-09 21:39:35,242 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 29 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2025-01-09 21:39:35,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 634 flow [2025-01-09 21:39:35,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2025-01-09 21:39:35,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413447782546495 [2025-01-09 21:39:35,245 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 534 flow. Second operand 3 states and 658 transitions. [2025-01-09 21:39:35,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 634 flow [2025-01-09 21:39:35,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:35,251 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 574 flow [2025-01-09 21:39:35,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2025-01-09 21:39:35,252 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2025-01-09 21:39:35,252 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 574 flow [2025-01-09 21:39:35,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-01-09 21:39:35,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:35,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:35,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:39:35,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:35,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash -636381934, now seen corresponding path program 1 times [2025-01-09 21:39:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501402878] [2025-01-09 21:39:35,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:35,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:39:35,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:39:35,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:35,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:35,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501402878] [2025-01-09 21:39:35,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501402878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:35,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967066325] [2025-01-09 21:39:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:35,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:35,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:35,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:35,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-01-09 21:39:35,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-01-09 21:39:35,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:35,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-01-09 21:39:35,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:35,568 INFO L124 PetriNetUnfolderBase]: 83/766 cut-off events. [2025-01-09 21:39:35,570 INFO L125 PetriNetUnfolderBase]: For 65/69 co-relation queries the response was YES. [2025-01-09 21:39:35,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 766 events. 83/766 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3977 event pairs, 45 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 870. Up to 114 conditions per place. [2025-01-09 21:39:35,574 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 17 selfloop transitions, 3 changer transitions 1/249 dead transitions. [2025-01-09 21:39:35,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 249 transitions, 628 flow [2025-01-09 21:39:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2025-01-09 21:39:35,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585121602288984 [2025-01-09 21:39:35,577 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 574 flow. Second operand 3 states and 670 transitions. [2025-01-09 21:39:35,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 249 transitions, 628 flow [2025-01-09 21:39:35,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 249 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:35,587 INFO L231 Difference]: Finished difference. Result has 240 places, 245 transitions, 582 flow [2025-01-09 21:39:35,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=240, PETRI_TRANSITIONS=245} [2025-01-09 21:39:35,589 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 7 predicate places. [2025-01-09 21:39:35,589 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 245 transitions, 582 flow [2025-01-09 21:39:35,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-01-09 21:39:35,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:35,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:35,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:39:35,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:35,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1177976219, now seen corresponding path program 1 times [2025-01-09 21:39:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:35,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114387105] [2025-01-09 21:39:35,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:35,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:39:35,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:39:35,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:35,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:35,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:35,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114387105] [2025-01-09 21:39:35,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114387105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:35,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:35,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:35,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443629305] [2025-01-09 21:39:35,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:35,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:35,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:35,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:35,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:35,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 233 [2025-01-09 21:39:35,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 245 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-01-09 21:39:35,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:35,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 233 [2025-01-09 21:39:35,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:35,859 INFO L124 PetriNetUnfolderBase]: 92/781 cut-off events. [2025-01-09 21:39:35,859 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2025-01-09 21:39:35,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 781 events. 92/781 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4222 event pairs, 54 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 942. Up to 141 conditions per place. [2025-01-09 21:39:35,864 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 22 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-01-09 21:39:35,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 254 transitions, 658 flow [2025-01-09 21:39:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-01-09 21:39:35,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570815450643777 [2025-01-09 21:39:35,866 INFO L175 Difference]: Start difference. First operand has 240 places, 245 transitions, 582 flow. Second operand 3 states and 669 transitions. [2025-01-09 21:39:35,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 254 transitions, 658 flow [2025-01-09 21:39:35,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 254 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:35,875 INFO L231 Difference]: Finished difference. Result has 242 places, 248 transitions, 612 flow [2025-01-09 21:39:35,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=242, PETRI_TRANSITIONS=248} [2025-01-09 21:39:35,877 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 9 predicate places. [2025-01-09 21:39:35,877 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 248 transitions, 612 flow [2025-01-09 21:39:35,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-01-09 21:39:35,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:35,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:35,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:39:35,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:35,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2010086699, now seen corresponding path program 1 times [2025-01-09 21:39:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:35,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455518203] [2025-01-09 21:39:35,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:35,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 21:39:35,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 21:39:35,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:35,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:35,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:35,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455518203] [2025-01-09 21:39:35,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455518203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:35,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:35,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:35,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547899959] [2025-01-09 21:39:35,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:35,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:35,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:35,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:35,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:36,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-01-09 21:39:36,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 248 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-01-09 21:39:36,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:36,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-01-09 21:39:36,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:36,167 INFO L124 PetriNetUnfolderBase]: 159/965 cut-off events. [2025-01-09 21:39:36,168 INFO L125 PetriNetUnfolderBase]: For 209/216 co-relation queries the response was YES. [2025-01-09 21:39:36,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 965 events. 159/965 cut-off events. For 209/216 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5533 event pairs, 73 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 1423. Up to 275 conditions per place. [2025-01-09 21:39:36,172 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 29 selfloop transitions, 11 changer transitions 4/261 dead transitions. [2025-01-09 21:39:36,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 261 transitions, 734 flow [2025-01-09 21:39:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-01-09 21:39:36,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513590844062947 [2025-01-09 21:39:36,174 INFO L175 Difference]: Start difference. First operand has 242 places, 248 transitions, 612 flow. Second operand 3 states and 665 transitions. [2025-01-09 21:39:36,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 261 transitions, 734 flow [2025-01-09 21:39:36,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 261 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:36,184 INFO L231 Difference]: Finished difference. Result has 244 places, 252 transitions, 678 flow [2025-01-09 21:39:36,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=244, PETRI_TRANSITIONS=252} [2025-01-09 21:39:36,185 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 11 predicate places. [2025-01-09 21:39:36,185 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 252 transitions, 678 flow [2025-01-09 21:39:36,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-01-09 21:39:36,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:36,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:36,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:39:36,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:36,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:36,190 INFO L85 PathProgramCache]: Analyzing trace with hash -268877534, now seen corresponding path program 1 times [2025-01-09 21:39:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:36,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975391013] [2025-01-09 21:39:36,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:36,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:36,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:36,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:36,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:36,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:36,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975391013] [2025-01-09 21:39:36,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975391013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890298782] [2025-01-09 21:39:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:36,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:39:36,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:36,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:39:36,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:39:36,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-01-09 21:39:36,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 252 transitions, 678 flow. Second operand has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 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-01-09 21:39:36,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:36,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-01-09 21:39:36,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:36,713 INFO L124 PetriNetUnfolderBase]: 140/883 cut-off events. [2025-01-09 21:39:36,713 INFO L125 PetriNetUnfolderBase]: For 289/296 co-relation queries the response was YES. [2025-01-09 21:39:36,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 883 events. 140/883 cut-off events. For 289/296 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4730 event pairs, 39 based on Foata normal form. 2/836 useless extension candidates. Maximal degree in co-relation 1328. Up to 139 conditions per place. [2025-01-09 21:39:36,718 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 29 selfloop transitions, 7 changer transitions 3/267 dead transitions. [2025-01-09 21:39:36,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 267 transitions, 774 flow [2025-01-09 21:39:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1307 transitions. [2025-01-09 21:39:36,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9349070100143062 [2025-01-09 21:39:36,721 INFO L175 Difference]: Start difference. First operand has 244 places, 252 transitions, 678 flow. Second operand 6 states and 1307 transitions. [2025-01-09 21:39:36,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 267 transitions, 774 flow [2025-01-09 21:39:36,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 267 transitions, 738 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-09 21:39:36,730 INFO L231 Difference]: Finished difference. Result has 244 places, 253 transitions, 664 flow [2025-01-09 21:39:36,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=664, PETRI_PLACES=244, PETRI_TRANSITIONS=253} [2025-01-09 21:39:36,732 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 11 predicate places. [2025-01-09 21:39:36,733 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 253 transitions, 664 flow [2025-01-09 21:39:36,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 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-01-09 21:39:36,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:36,734 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:36,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:39:36,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1016743939, now seen corresponding path program 1 times [2025-01-09 21:39:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:36,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863038037] [2025-01-09 21:39:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:36,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:36,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:36,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:36,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:36,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:39:36,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:36,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:36,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:36,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:36,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:39:36,896 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:39:36,896 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-01-09 21:39:36,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-01-09 21:39:36,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-01-09 21:39:36,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-01-09 21:39:36,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-01-09 21:39:36,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-01-09 21:39:36,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-01-09 21:39:36,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-01-09 21:39:36,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-01-09 21:39:36,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-01-09 21:39:36,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-01-09 21:39:36,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:39:36,902 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:36,905 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:39:36,905 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:39:36,935 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:36,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 265 transitions, 540 flow [2025-01-09 21:39:36,991 INFO L124 PetriNetUnfolderBase]: 7/355 cut-off events. [2025-01-09 21:39:36,991 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:39:36,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 355 events. 7/355 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 409 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2025-01-09 21:39:36,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 265 transitions, 540 flow [2025-01-09 21:39:36,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 265 transitions, 540 flow [2025-01-09 21:39:36,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:36,998 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;@1b722036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:36,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-09 21:39:37,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:37,014 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-01-09 21:39:37,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:37,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:37,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:37,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:37,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2030981870, now seen corresponding path program 1 times [2025-01-09 21:39:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501396612] [2025-01-09 21:39:37,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:37,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:39:37,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:39:37,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:37,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:37,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:37,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501396612] [2025-01-09 21:39:37,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501396612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:37,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:37,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481796691] [2025-01-09 21:39:37,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:37,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:37,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:37,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:37,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:37,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 265 [2025-01-09 21:39:37,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 265 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-01-09 21:39:37,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:37,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 265 [2025-01-09 21:39:37,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:38,246 INFO L124 PetriNetUnfolderBase]: 2216/7107 cut-off events. [2025-01-09 21:39:38,247 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-09 21:39:38,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 7107 events. 2216/7107 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 68831 event pairs, 879 based on Foata normal form. 1/6349 useless extension candidates. Maximal degree in co-relation 9184. Up to 2089 conditions per place. [2025-01-09 21:39:38,297 INFO L140 encePairwiseOnDemand]: 248/265 looper letters, 46 selfloop transitions, 11 changer transitions 1/289 dead transitions. [2025-01-09 21:39:38,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 289 transitions, 707 flow [2025-01-09 21:39:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-01-09 21:39:38,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2025-01-09 21:39:38,300 INFO L175 Difference]: Start difference. First operand has 267 places, 265 transitions, 540 flow. Second operand 3 states and 760 transitions. [2025-01-09 21:39:38,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 289 transitions, 707 flow [2025-01-09 21:39:38,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 289 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:38,306 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 630 flow [2025-01-09 21:39:38,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2025-01-09 21:39:38,308 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 4 predicate places. [2025-01-09 21:39:38,308 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 630 flow [2025-01-09 21:39:38,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-01-09 21:39:38,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:38,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:38,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:39:38,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:38,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:38,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1433309452, now seen corresponding path program 1 times [2025-01-09 21:39:38,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:38,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379523965] [2025-01-09 21:39:38,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:38,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:38,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:39:38,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:39:38,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:38,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379523965] [2025-01-09 21:39:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379523965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:38,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122384538] [2025-01-09 21:39:38,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:38,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:38,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:38,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:38,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 265 [2025-01-09 21:39:38,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-01-09 21:39:38,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:38,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 265 [2025-01-09 21:39:38,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:39,910 INFO L124 PetriNetUnfolderBase]: 2480/9018 cut-off events. [2025-01-09 21:39:39,911 INFO L125 PetriNetUnfolderBase]: For 2842/3012 co-relation queries the response was YES. [2025-01-09 21:39:39,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 9018 events. 2480/9018 cut-off events. For 2842/3012 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 94609 event pairs, 1597 based on Foata normal form. 62/8284 useless extension candidates. Maximal degree in co-relation 13582. Up to 3442 conditions per place. [2025-01-09 21:39:39,978 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 42 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2025-01-09 21:39:39,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 291 transitions, 798 flow [2025-01-09 21:39:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2025-01-09 21:39:39,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9383647798742139 [2025-01-09 21:39:39,980 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 630 flow. Second operand 3 states and 746 transitions. [2025-01-09 21:39:39,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 291 transitions, 798 flow [2025-01-09 21:39:39,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 291 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:39,993 INFO L231 Difference]: Finished difference. Result has 272 places, 283 transitions, 714 flow [2025-01-09 21:39:39,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=272, PETRI_TRANSITIONS=283} [2025-01-09 21:39:39,994 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2025-01-09 21:39:39,995 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 283 transitions, 714 flow [2025-01-09 21:39:39,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-01-09 21:39:39,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:39,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:39,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:39:39,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:39,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:39,996 INFO L85 PathProgramCache]: Analyzing trace with hash -162582766, now seen corresponding path program 1 times [2025-01-09 21:39:39,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:39,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380767654] [2025-01-09 21:39:39,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:39,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:40,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:39:40,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:39:40,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:40,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380767654] [2025-01-09 21:39:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380767654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:40,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831466339] [2025-01-09 21:39:40,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:40,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:40,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:40,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:40,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:40,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 265 [2025-01-09 21:39:40,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 283 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-01-09 21:39:40,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:40,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 265 [2025-01-09 21:39:40,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:41,377 INFO L124 PetriNetUnfolderBase]: 1878/8140 cut-off events. [2025-01-09 21:39:41,378 INFO L125 PetriNetUnfolderBase]: For 1127/2075 co-relation queries the response was YES. [2025-01-09 21:39:41,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13070 conditions, 8140 events. 1878/8140 cut-off events. For 1127/2075 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 89530 event pairs, 1092 based on Foata normal form. 7/7222 useless extension candidates. Maximal degree in co-relation 11327. Up to 1725 conditions per place. [2025-01-09 21:39:41,445 INFO L140 encePairwiseOnDemand]: 260/265 looper letters, 28 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2025-01-09 21:39:41,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 294 transitions, 800 flow [2025-01-09 21:39:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-01-09 21:39:41,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2025-01-09 21:39:41,448 INFO L175 Difference]: Start difference. First operand has 272 places, 283 transitions, 714 flow. Second operand 3 states and 759 transitions. [2025-01-09 21:39:41,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 294 transitions, 800 flow [2025-01-09 21:39:41,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 294 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:41,463 INFO L231 Difference]: Finished difference. Result has 274 places, 286 transitions, 720 flow [2025-01-09 21:39:41,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=274, PETRI_TRANSITIONS=286} [2025-01-09 21:39:41,464 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 7 predicate places. [2025-01-09 21:39:41,464 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 286 transitions, 720 flow [2025-01-09 21:39:41,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-01-09 21:39:41,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:41,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:41,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:39:41,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:41,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1636445393, now seen corresponding path program 1 times [2025-01-09 21:39:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:41,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102187718] [2025-01-09 21:39:41,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:41,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:39:41,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:39:41,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:41,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:41,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:41,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102187718] [2025-01-09 21:39:41,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102187718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:41,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:41,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482361066] [2025-01-09 21:39:41,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:41,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:41,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:41,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:41,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 265 [2025-01-09 21:39:41,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 286 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-01-09 21:39:41,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:41,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 265 [2025-01-09 21:39:41,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:43,337 INFO L124 PetriNetUnfolderBase]: 2430/10427 cut-off events. [2025-01-09 21:39:43,337 INFO L125 PetriNetUnfolderBase]: For 1615/2592 co-relation queries the response was YES. [2025-01-09 21:39:43,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17122 conditions, 10427 events. 2430/10427 cut-off events. For 1615/2592 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 122123 event pairs, 1418 based on Foata normal form. 11/9279 useless extension candidates. Maximal degree in co-relation 15284. Up to 2447 conditions per place. [2025-01-09 21:39:43,405 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 34 selfloop transitions, 7 changer transitions 0/302 dead transitions. [2025-01-09 21:39:43,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 302 transitions, 849 flow [2025-01-09 21:39:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-01-09 21:39:43,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2025-01-09 21:39:43,407 INFO L175 Difference]: Start difference. First operand has 274 places, 286 transitions, 720 flow. Second operand 3 states and 759 transitions. [2025-01-09 21:39:43,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 302 transitions, 849 flow [2025-01-09 21:39:43,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 302 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:43,419 INFO L231 Difference]: Finished difference. Result has 276 places, 291 transitions, 768 flow [2025-01-09 21:39:43,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=276, PETRI_TRANSITIONS=291} [2025-01-09 21:39:43,420 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 9 predicate places. [2025-01-09 21:39:43,420 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 291 transitions, 768 flow [2025-01-09 21:39:43,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-01-09 21:39:43,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:43,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:43,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:39:43,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:43,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1730603884, now seen corresponding path program 1 times [2025-01-09 21:39:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872331962] [2025-01-09 21:39:43,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 21:39:43,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 21:39:43,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:43,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:43,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:43,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872331962] [2025-01-09 21:39:43,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872331962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:43,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:43,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:43,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310156899] [2025-01-09 21:39:43,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:43,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:43,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:43,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:43,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:43,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 265 [2025-01-09 21:39:43,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 291 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-01-09 21:39:43,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:43,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 265 [2025-01-09 21:39:43,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:44,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][272], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 290#true, Black: 282#(= |#race~data~0| 0), 266#true, 209#L695-7true, 202#L712-1true, 285#true]) [2025-01-09 21:39:44,759 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-01-09 21:39:44,759 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:44,760 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:44,760 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:44,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 39#L697true, 290#true, 266#true, Black: 282#(= |#race~data~0| 0), 202#L712-1true, 285#true]) [2025-01-09 21:39:44,872 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-01-09 21:39:44,872 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:39:44,872 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:39:44,872 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:39:44,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 290#true, 266#true, Black: 282#(= |#race~data~0| 0), 264#L697-3true, 285#true, 202#L712-1true]) [2025-01-09 21:39:44,903 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-01-09 21:39:44,903 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-01-09 21:39:44,903 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:44,903 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:45,064 INFO L124 PetriNetUnfolderBase]: 4089/14024 cut-off events. [2025-01-09 21:39:45,064 INFO L125 PetriNetUnfolderBase]: For 5620/6024 co-relation queries the response was YES. [2025-01-09 21:39:45,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26408 conditions, 14024 events. 4089/14024 cut-off events. For 5620/6024 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 159149 event pairs, 2076 based on Foata normal form. 74/12674 useless extension candidates. Maximal degree in co-relation 22270. Up to 5204 conditions per place. [2025-01-09 21:39:45,286 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 49 selfloop transitions, 19 changer transitions 0/317 dead transitions. [2025-01-09 21:39:45,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 317 transitions, 1005 flow [2025-01-09 21:39:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2025-01-09 21:39:45,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9484276729559749 [2025-01-09 21:39:45,294 INFO L175 Difference]: Start difference. First operand has 276 places, 291 transitions, 768 flow. Second operand 3 states and 754 transitions. [2025-01-09 21:39:45,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 317 transitions, 1005 flow [2025-01-09 21:39:45,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 317 transitions, 991 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:45,308 INFO L231 Difference]: Finished difference. Result has 278 places, 306 transitions, 936 flow [2025-01-09 21:39:45,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=278, PETRI_TRANSITIONS=306} [2025-01-09 21:39:45,314 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2025-01-09 21:39:45,314 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 306 transitions, 936 flow [2025-01-09 21:39:45,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-01-09 21:39:45,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:45,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:45,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:39:45,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:45,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash -872170100, now seen corresponding path program 1 times [2025-01-09 21:39:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058366644] [2025-01-09 21:39:45,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:45,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:45,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:45,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:45,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:45,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058366644] [2025-01-09 21:39:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058366644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:45,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:45,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:45,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573417009] [2025-01-09 21:39:45,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:45,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:39:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:45,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:39:45,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:39:45,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2025-01-09 21:39:45,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 306 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 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-01-09 21:39:45,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:45,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2025-01-09 21:39:45,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:47,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][277], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 290#true, Black: 282#(= |#race~data~0| 0), 266#true, 209#L695-7true, 202#L712-1true, 295#true]) [2025-01-09 21:39:47,001 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,001 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:47,002 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,002 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:47,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L705-5-->L705-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 272#(= |#race~threads_alive~0| 0), 225#L695-2true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 275#true, 62#L705-6true, Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 209#L695-7true, 295#true]) [2025-01-09 21:39:47,029 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-01-09 21:39:47,029 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:47,029 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:47,029 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:47,048 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][277], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 290#true, Black: 282#(= |#race~data~0| 0), 266#true, 202#L712-1true, 295#true, 209#L695-7true]) [2025-01-09 21:39:47,048 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,048 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:47,048 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,048 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:47,048 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,053 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][277], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 266#true, Black: 282#(= |#race~data~0| 0), 290#true, 202#L712-1true, 295#true, 209#L695-7true]) [2025-01-09 21:39:47,053 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,053 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,053 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:47,053 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,053 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:47,053 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][277], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 199#L695-1true, Black: 282#(= |#race~data~0| 0), 266#true, 290#true, 209#L695-7true, 295#true, 202#L712-1true]) [2025-01-09 21:39:47,102 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-01-09 21:39:47,102 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:47,102 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:47,102 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:47,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 39#L697true, Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 202#L712-1true, 295#true]) [2025-01-09 21:39:47,145 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-01-09 21:39:47,145 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:39:47,145 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:39:47,145 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:39:47,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 147#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 266#true, Black: 282#(= |#race~data~0| 0), 290#true, 295#true, 202#L712-1true]) [2025-01-09 21:39:47,200 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,200 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,200 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:47,200 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:47,236 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 39#L697true, 266#true, 290#true, Black: 282#(= |#race~data~0| 0), 295#true, 202#L712-1true]) [2025-01-09 21:39:47,236 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-01-09 21:39:47,236 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:39:47,236 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:39:47,236 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:39:47,236 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:39:47,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([839] L695-3-->L695-4: Formula: (= (+ v_~threads_alive~0_7 1) |v_threadThread2of2ForFork0_#t~post5_3|) InVars {threadThread2of2ForFork0_#t~post5=|v_threadThread2of2ForFork0_#t~post5_3|} OutVars{threadThread2of2ForFork0_#t~post5=|v_threadThread2of2ForFork0_#t~post5_3|, ~threads_alive~0=v_~threads_alive~0_7} AuxVars[] AssignedVars[~threads_alive~0][293], [5#L695-4true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 241#L706-3true, 157#L695-4true, Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 295#true]) [2025-01-09 21:39:47,253 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-01-09 21:39:47,253 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:39:47,253 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:39:47,253 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:39:47,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([772] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 264#L697-3true, 202#L712-1true, 295#true]) [2025-01-09 21:39:47,285 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-01-09 21:39:47,285 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-01-09 21:39:47,285 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-01-09 21:39:47,285 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:47,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([810] L695-5-->L695-6: Formula: (= |v_#race~threads_alive~0_11| |v_threadThread1of2ForFork0_#t~nondet6_3|) InVars {threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_3|} OutVars{threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_3|, #race~threads_alive~0=|v_#race~threads_alive~0_11|} AuxVars[] AssignedVars[#race~threads_alive~0][224], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 272#(= |#race~threads_alive~0| 0), 225#L695-2true, 268#true, 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 290#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 160#L695-6true, Black: 282#(= |#race~data~0| 0), 266#true, 295#true, 237#L706true]) [2025-01-09 21:39:47,294 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is not cut-off event [2025-01-09 21:39:47,294 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:39:47,294 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:39:47,294 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:39:47,540 INFO L124 PetriNetUnfolderBase]: 4694/16323 cut-off events. [2025-01-09 21:39:47,540 INFO L125 PetriNetUnfolderBase]: For 7356/8216 co-relation queries the response was YES. [2025-01-09 21:39:47,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31425 conditions, 16323 events. 4694/16323 cut-off events. For 7356/8216 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 194406 event pairs, 1723 based on Foata normal form. 75/14509 useless extension candidates. Maximal degree in co-relation 16806. Up to 4159 conditions per place. [2025-01-09 21:39:47,663 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 45 selfloop transitions, 9 changer transitions 2/336 dead transitions. [2025-01-09 21:39:47,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 336 transitions, 1108 flow [2025-01-09 21:39:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1480 transitions. [2025-01-09 21:39:47,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9308176100628931 [2025-01-09 21:39:47,667 INFO L175 Difference]: Start difference. First operand has 278 places, 306 transitions, 936 flow. Second operand 6 states and 1480 transitions. [2025-01-09 21:39:47,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 336 transitions, 1108 flow [2025-01-09 21:39:47,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 336 transitions, 1070 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:47,707 INFO L231 Difference]: Finished difference. Result has 283 places, 313 transitions, 949 flow [2025-01-09 21:39:47,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=283, PETRI_TRANSITIONS=313} [2025-01-09 21:39:47,709 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 16 predicate places. [2025-01-09 21:39:47,709 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 313 transitions, 949 flow [2025-01-09 21:39:47,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 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-01-09 21:39:47,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:47,711 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:47,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:39:47,711 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:47,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1498061692, now seen corresponding path program 1 times [2025-01-09 21:39:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824241014] [2025-01-09 21:39:47,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:47,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 21:39:47,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 21:39:47,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:47,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:48,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:48,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824241014] [2025-01-09 21:39:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824241014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:39:48,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757520366] [2025-01-09 21:39:48,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:48,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:48,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:48,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:48,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 265 [2025-01-09 21:39:48,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 313 transitions, 949 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-01-09 21:39:48,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:48,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 265 [2025-01-09 21:39:48,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:48,762 INFO L124 PetriNetUnfolderBase]: 321/2795 cut-off events. [2025-01-09 21:39:48,762 INFO L125 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES. [2025-01-09 21:39:48,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4824 conditions, 2795 events. 321/2795 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 24146 event pairs, 119 based on Foata normal form. 86/2730 useless extension candidates. Maximal degree in co-relation 4242. Up to 283 conditions per place. [2025-01-09 21:39:48,783 INFO L140 encePairwiseOnDemand]: 253/265 looper letters, 11 selfloop transitions, 12 changer transitions 0/279 dead transitions. [2025-01-09 21:39:48,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 279 transitions, 770 flow [2025-01-09 21:39:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:39:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:39:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1253 transitions. [2025-01-09 21:39:48,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456603773584905 [2025-01-09 21:39:48,787 INFO L175 Difference]: Start difference. First operand has 283 places, 313 transitions, 949 flow. Second operand 5 states and 1253 transitions. [2025-01-09 21:39:48,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 279 transitions, 770 flow [2025-01-09 21:39:48,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 279 transitions, 724 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-01-09 21:39:48,799 INFO L231 Difference]: Finished difference. Result has 277 places, 274 transitions, 687 flow [2025-01-09 21:39:48,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=687, PETRI_PLACES=277, PETRI_TRANSITIONS=274} [2025-01-09 21:39:48,800 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 10 predicate places. [2025-01-09 21:39:48,801 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 274 transitions, 687 flow [2025-01-09 21:39:48,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-01-09 21:39:48,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:48,802 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:48,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:39:48,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:48,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash -727877969, now seen corresponding path program 1 times [2025-01-09 21:39:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:48,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119226082] [2025-01-09 21:39:48,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:48,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 21:39:48,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 21:39:48,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:48,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119226082] [2025-01-09 21:39:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119226082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:48,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:48,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:48,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951962966] [2025-01-09 21:39:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:48,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:48,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:48,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:48,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 265 [2025-01-09 21:39:48,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 274 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 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-01-09 21:39:48,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:48,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 265 [2025-01-09 21:39:48,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:49,425 INFO L124 PetriNetUnfolderBase]: 1083/4735 cut-off events. [2025-01-09 21:39:49,426 INFO L125 PetriNetUnfolderBase]: For 1577/1589 co-relation queries the response was YES. [2025-01-09 21:39:49,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8940 conditions, 4735 events. 1083/4735 cut-off events. For 1577/1589 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 45870 event pairs, 573 based on Foata normal form. 0/4438 useless extension candidates. Maximal degree in co-relation 8355. Up to 1492 conditions per place. [2025-01-09 21:39:49,449 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 34 selfloop transitions, 10 changer transitions 0/290 dead transitions. [2025-01-09 21:39:49,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 290 transitions, 839 flow [2025-01-09 21:39:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2025-01-09 21:39:49,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2025-01-09 21:39:49,451 INFO L175 Difference]: Start difference. First operand has 277 places, 274 transitions, 687 flow. Second operand 3 states and 758 transitions. [2025-01-09 21:39:49,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 290 transitions, 839 flow [2025-01-09 21:39:49,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 290 transitions, 818 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:39:49,459 INFO L231 Difference]: Finished difference. Result has 278 places, 280 transitions, 756 flow [2025-01-09 21:39:49,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=278, PETRI_TRANSITIONS=280} [2025-01-09 21:39:49,461 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2025-01-09 21:39:49,461 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 280 transitions, 756 flow [2025-01-09 21:39:49,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 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-01-09 21:39:49,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:49,462 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:49,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:39:49,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:49,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash 22780308, now seen corresponding path program 1 times [2025-01-09 21:39:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:49,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158059226] [2025-01-09 21:39:49,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:49,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 21:39:49,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 21:39:49,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:49,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:49,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:49,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158059226] [2025-01-09 21:39:49,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158059226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:49,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:49,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:39:49,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453442223] [2025-01-09 21:39:49,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:49,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:49,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:49,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:49,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:49,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 265 [2025-01-09 21:39:49,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 280 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-01-09 21:39:49,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:49,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 265 [2025-01-09 21:39:49,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:50,363 INFO L124 PetriNetUnfolderBase]: 646/4760 cut-off events. [2025-01-09 21:39:50,364 INFO L125 PetriNetUnfolderBase]: For 1802/1955 co-relation queries the response was YES. [2025-01-09 21:39:50,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8534 conditions, 4760 events. 646/4760 cut-off events. For 1802/1955 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 50488 event pairs, 112 based on Foata normal form. 15/4561 useless extension candidates. Maximal degree in co-relation 7323. Up to 698 conditions per place. [2025-01-09 21:39:50,405 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 21 selfloop transitions, 9 changer transitions 0/293 dead transitions. [2025-01-09 21:39:50,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 293 transitions, 857 flow [2025-01-09 21:39:50,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:50,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2025-01-09 21:39:50,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685534591194969 [2025-01-09 21:39:50,407 INFO L175 Difference]: Start difference. First operand has 278 places, 280 transitions, 756 flow. Second operand 3 states and 770 transitions. [2025-01-09 21:39:50,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 293 transitions, 857 flow [2025-01-09 21:39:50,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 293 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:50,418 INFO L231 Difference]: Finished difference. Result has 279 places, 287 transitions, 796 flow [2025-01-09 21:39:50,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=279, PETRI_TRANSITIONS=287} [2025-01-09 21:39:50,419 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 12 predicate places. [2025-01-09 21:39:50,419 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 287 transitions, 796 flow [2025-01-09 21:39:50,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-01-09 21:39:50,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:50,420 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:50,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:39:50,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:50,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1671921260, now seen corresponding path program 2 times [2025-01-09 21:39:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:50,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396655613] [2025-01-09 21:39:50,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:39:50,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:50,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 1 equivalence classes. [2025-01-09 21:39:50,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 21:39:50,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:39:50,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:50,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:50,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396655613] [2025-01-09 21:39:50,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396655613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:50,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:50,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:39:50,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301445119] [2025-01-09 21:39:50,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:50,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:50,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:50,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:50,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:50,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 265 [2025-01-09 21:39:50,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 287 transitions, 796 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-01-09 21:39:50,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:50,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 265 [2025-01-09 21:39:50,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:51,302 INFO L124 PetriNetUnfolderBase]: 303/2908 cut-off events. [2025-01-09 21:39:51,305 INFO L125 PetriNetUnfolderBase]: For 998/1192 co-relation queries the response was YES. [2025-01-09 21:39:51,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5235 conditions, 2908 events. 303/2908 cut-off events. For 998/1192 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 26054 event pairs, 40 based on Foata normal form. 67/2874 useless extension candidates. Maximal degree in co-relation 4239. Up to 326 conditions per place. [2025-01-09 21:39:51,319 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 28 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2025-01-09 21:39:51,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 875 flow [2025-01-09 21:39:51,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:39:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:39:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1256 transitions. [2025-01-09 21:39:51,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479245283018868 [2025-01-09 21:39:51,325 INFO L175 Difference]: Start difference. First operand has 279 places, 287 transitions, 796 flow. Second operand 5 states and 1256 transitions. [2025-01-09 21:39:51,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 875 flow [2025-01-09 21:39:51,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 862 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:39:51,337 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 759 flow [2025-01-09 21:39:51,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2025-01-09 21:39:51,338 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 15 predicate places. [2025-01-09 21:39:51,339 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 759 flow [2025-01-09 21:39:51,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-01-09 21:39:51,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:51,340 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:51,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:39:51,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:51,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1805190669, now seen corresponding path program 1 times [2025-01-09 21:39:51,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:51,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050752659] [2025-01-09 21:39:51,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:51,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 21:39:51,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 21:39:51,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:51,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050752659] [2025-01-09 21:39:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050752659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:51,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652071921] [2025-01-09 21:39:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:51,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:51,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:51,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:51,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:51,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 265 [2025-01-09 21:39:51,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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-01-09 21:39:51,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:51,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 265 [2025-01-09 21:39:51,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:51,999 INFO L124 PetriNetUnfolderBase]: 503/3655 cut-off events. [2025-01-09 21:39:51,999 INFO L125 PetriNetUnfolderBase]: For 2118/2362 co-relation queries the response was YES. [2025-01-09 21:39:52,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 3655 events. 503/3655 cut-off events. For 2118/2362 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 34977 event pairs, 226 based on Foata normal form. 6/3506 useless extension candidates. Maximal degree in co-relation 6430. Up to 891 conditions per place. [2025-01-09 21:39:52,025 INFO L140 encePairwiseOnDemand]: 262/265 looper letters, 37 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-01-09 21:39:52,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 853 flow [2025-01-09 21:39:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2025-01-09 21:39:52,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9270440251572327 [2025-01-09 21:39:52,027 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 759 flow. Second operand 3 states and 737 transitions. [2025-01-09 21:39:52,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 853 flow [2025-01-09 21:39:52,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 284 transitions, 841 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:39:52,035 INFO L231 Difference]: Finished difference. Result has 280 places, 281 transitions, 752 flow [2025-01-09 21:39:52,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=280, PETRI_TRANSITIONS=281} [2025-01-09 21:39:52,037 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 13 predicate places. [2025-01-09 21:39:52,037 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 281 transitions, 752 flow [2025-01-09 21:39:52,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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-01-09 21:39:52,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:52,038 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:52,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:39:52,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:52,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1771599361, now seen corresponding path program 1 times [2025-01-09 21:39:52,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:52,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326592241] [2025-01-09 21:39:52,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:52,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:39:52,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:39:52,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:52,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326592241] [2025-01-09 21:39:52,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326592241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:52,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:52,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:39:52,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382040463] [2025-01-09 21:39:52,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:52,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:39:52,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:52,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:39:52,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:39:52,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2025-01-09 21:39:52,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 281 transitions, 752 flow. Second operand has 7 states, 7 states have (on average 239.57142857142858) internal successors, (1677), 7 states have internal predecessors, (1677), 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-01-09 21:39:52,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:52,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2025-01-09 21:39:52,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:52,806 INFO L124 PetriNetUnfolderBase]: 323/2359 cut-off events. [2025-01-09 21:39:52,806 INFO L125 PetriNetUnfolderBase]: For 1004/1066 co-relation queries the response was YES. [2025-01-09 21:39:52,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4534 conditions, 2359 events. 323/2359 cut-off events. For 1004/1066 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 18286 event pairs, 78 based on Foata normal form. 22/2301 useless extension candidates. Maximal degree in co-relation 3270. Up to 288 conditions per place. [2025-01-09 21:39:52,816 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 70 selfloop transitions, 14 changer transitions 12/333 dead transitions. [2025-01-09 21:39:52,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 333 transitions, 1161 flow [2025-01-09 21:39:52,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:39:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:39:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2210 transitions. [2025-01-09 21:39:52,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9266247379454927 [2025-01-09 21:39:52,820 INFO L175 Difference]: Start difference. First operand has 280 places, 281 transitions, 752 flow. Second operand 9 states and 2210 transitions. [2025-01-09 21:39:52,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 333 transitions, 1161 flow [2025-01-09 21:39:52,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 333 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:52,828 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 795 flow [2025-01-09 21:39:52,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=795, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2025-01-09 21:39:52,828 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 21 predicate places. [2025-01-09 21:39:52,828 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 795 flow [2025-01-09 21:39:52,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 239.57142857142858) internal successors, (1677), 7 states have internal predecessors, (1677), 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-01-09 21:39:52,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:52,829 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:52,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:39:52,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:52,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:52,831 INFO L85 PathProgramCache]: Analyzing trace with hash 438735143, now seen corresponding path program 1 times [2025-01-09 21:39:52,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:52,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254482493] [2025-01-09 21:39:52,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:52,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:52,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:39:52,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:39:52,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:52,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:52,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:39:52,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:39:52,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:39:52,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:52,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:52,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:39:52,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:39:52,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-01-09 21:39:52,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-01-09 21:39:52,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-01-09 21:39:52,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-01-09 21:39:52,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-01-09 21:39:52,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-01-09 21:39:52,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-01-09 21:39:52,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-01-09 21:39:52,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-01-09 21:39:52,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-01-09 21:39:52,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-01-09 21:39:52,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-01-09 21:39:52,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-01-09 21:39:52,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-01-09 21:39:52,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:39:52,970 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:52,971 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:39:52,971 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:39:53,003 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:53,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 301 places, 297 transitions, 612 flow [2025-01-09 21:39:53,049 INFO L124 PetriNetUnfolderBase]: 9/436 cut-off events. [2025-01-09 21:39:53,049 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:39:53,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 436 events. 9/436 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 583 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 359. Up to 8 conditions per place. [2025-01-09 21:39:53,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 297 transitions, 612 flow [2025-01-09 21:39:53,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 297 transitions, 612 flow [2025-01-09 21:39:53,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:53,055 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;@1b722036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:53,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-09 21:39:53,062 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:53,062 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-01-09 21:39:53,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:53,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:53,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:53,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:39:53,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash 573541774, now seen corresponding path program 1 times [2025-01-09 21:39:53,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:53,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663730455] [2025-01-09 21:39:53,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:53,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:53,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:39:53,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:39:53,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:53,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:53,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663730455] [2025-01-09 21:39:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663730455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:53,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:53,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858031414] [2025-01-09 21:39:53,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:53,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:53,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:53,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:53,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 297 [2025-01-09 21:39:53,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 297 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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-01-09 21:39:53,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:53,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 297 [2025-01-09 21:39:53,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:02,823 INFO L124 PetriNetUnfolderBase]: 35239/82973 cut-off events. [2025-01-09 21:40:02,824 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2025-01-09 21:40:03,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133785 conditions, 82973 events. 35239/82973 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2926. Compared 1039509 event pairs, 14941 based on Foata normal form. 1/74097 useless extension candidates. Maximal degree in co-relation 112523. Up to 27933 conditions per place. [2025-01-09 21:40:03,462 INFO L140 encePairwiseOnDemand]: 276/297 looper letters, 60 selfloop transitions, 14 changer transitions 1/329 dead transitions. [2025-01-09 21:40:03,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 329 transitions, 836 flow [2025-01-09 21:40:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 847 transitions. [2025-01-09 21:40:03,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506172839506173 [2025-01-09 21:40:03,465 INFO L175 Difference]: Start difference. First operand has 301 places, 297 transitions, 612 flow. Second operand 3 states and 847 transitions. [2025-01-09 21:40:03,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 329 transitions, 836 flow [2025-01-09 21:40:03,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 329 transitions, 832 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 21:40:03,474 INFO L231 Difference]: Finished difference. Result has 305 places, 308 transitions, 726 flow [2025-01-09 21:40:03,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=305, PETRI_TRANSITIONS=308} [2025-01-09 21:40:03,475 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 4 predicate places. [2025-01-09 21:40:03,475 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 308 transitions, 726 flow [2025-01-09 21:40:03,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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-01-09 21:40:03,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:03,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:03,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:40:03,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:40:03,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1458528451, now seen corresponding path program 1 times [2025-01-09 21:40:03,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:03,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965056956] [2025-01-09 21:40:03,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:03,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:03,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:40:03,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:40:03,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:03,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:03,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:03,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965056956] [2025-01-09 21:40:03,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965056956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:03,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:03,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:03,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298260512] [2025-01-09 21:40:03,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:03,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:03,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:03,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:03,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:03,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 297 [2025-01-09 21:40:03,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 308 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-01-09 21:40:03,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:03,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 297 [2025-01-09 21:40:03,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:07,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 35#L691-3true, 244#L695-2true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:07,672 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 80#L695-1true, 309#true, 35#L691-3true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:07,672 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 137#L695-1true, 35#L691-3true, 309#true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:07,672 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,672 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,866 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 80#L695-1true, 35#L691-3true, 309#true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:07,866 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-01-09 21:40:07,866 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,866 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,866 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-01-09 21:40:07,866 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,867 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 35#L691-3true, 137#L695-1true, 309#true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:07,867 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-01-09 21:40:07,867 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,868 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-01-09 21:40:07,868 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:07,868 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:40:08,059 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 35#L691-3true, 244#L695-2true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:08,059 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-01-09 21:40:08,059 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:40:08,059 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:40:08,059 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-01-09 21:40:08,060 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:40:08,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 35#L691-3true, 309#true, 244#L695-2true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:08,060 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-01-09 21:40:08,060 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:40:08,060 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-01-09 21:40:08,060 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:40:09,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 35#L691-3true, 67#L695-6true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:09,138 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2025-01-09 21:40:09,138 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:09,138 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-01-09 21:40:09,138 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-01-09 21:40:09,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 236#L695-6true, 224#L712-1true, 302#true, 35#L691-3true, 309#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:09,140 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2025-01-09 21:40:09,140 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-01-09 21:40:09,140 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:09,140 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-01-09 21:40:10,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 251#L697-3true, 224#L712-1true, 302#true, 309#true, 35#L691-3true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:10,504 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2025-01-09 21:40:10,504 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:40:10,504 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-01-09 21:40:10,504 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:40:10,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 35#L691-3true, 309#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 300#true, 125#L697-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:10,507 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2025-01-09 21:40:10,507 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-01-09 21:40:10,507 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:40:10,507 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:10,510 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 80#L695-1true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:10,510 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 137#L695-1true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:10,510 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,510 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,810 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 80#L695-1true, 309#true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:10,810 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-01-09 21:40:10,810 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,810 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,810 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-01-09 21:40:10,810 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,813 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 137#L695-1true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:10,813 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-01-09 21:40:10,813 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,813 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,813 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:10,813 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-01-09 21:40:11,130 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:11,131 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-01-09 21:40:11,131 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:11,131 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:11,131 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-01-09 21:40:11,131 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:11,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:11,131 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-01-09 21:40:11,131 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:11,131 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-01-09 21:40:11,131 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:11,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 226#L695-2true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:11,134 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-01-09 21:40:11,134 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:11,134 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:11,134 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:11,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 80#L695-1true, 244#L695-2true, 300#true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:11,135 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-01-09 21:40:11,135 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,135 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,135 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 137#L695-1true, 309#true, 300#true, 226#L695-2true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:11,135 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-01-09 21:40:11,135 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,135 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,135 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,597 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 80#L695-1true, 244#L695-2true, 300#true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:11,597 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-01-09 21:40:11,597 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:11,597 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,597 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,597 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,599 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 137#L695-1true, 300#true, 226#L695-2true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:11,599 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-01-09 21:40:11,599 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:11,599 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,599 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,599 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:11,829 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 226#L695-2true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:11,829 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-01-09 21:40:11,829 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-01-09 21:40:11,829 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:11,829 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:11,829 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:11,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 267#L694-3true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:11,830 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-01-09 21:40:11,830 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:11,830 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:11,830 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-01-09 21:40:12,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 67#L695-6true, 309#true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:12,535 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2025-01-09 21:40:12,535 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-01-09 21:40:12,535 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-01-09 21:40:12,535 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-01-09 21:40:12,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 236#L695-6true, 224#L712-1true, 302#true, 309#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 300#true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:12,540 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2025-01-09 21:40:12,540 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-01-09 21:40:12,540 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-01-09 21:40:12,540 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-01-09 21:40:13,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 67#L695-6true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:13,221 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-01-09 21:40:13,221 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:13,221 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-01-09 21:40:13,221 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:13,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 236#L695-6true, 224#L712-1true, 302#true, 309#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 300#true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:13,223 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-01-09 21:40:13,223 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-01-09 21:40:13,223 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:13,223 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:13,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 251#L697-3true, 224#L712-1true, 302#true, 309#true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:13,688 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-01-09 21:40:13,688 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:13,688 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-01-09 21:40:13,688 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:13,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 300#true, 125#L697-3true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2025-01-09 21:40:13,692 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-01-09 21:40:13,692 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:13,692 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-01-09 21:40:13,692 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:14,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 251#L697-3true, 224#L712-1true, 302#true, 309#true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:14,410 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-01-09 21:40:14,410 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2025-01-09 21:40:14,410 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-01-09 21:40:14,410 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-01-09 21:40:14,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 300#true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0), 125#L697-3true]) [2025-01-09 21:40:14,413 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-01-09 21:40:14,413 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-01-09 21:40:14,413 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-01-09 21:40:14,413 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2025-01-09 21:40:16,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 304#true, 298#true, 251#L697-3true, 224#L712-1true, 302#true, 309#true, 300#true, 159#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 125#L697-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:16,182 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2025-01-09 21:40:16,182 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-01-09 21:40:16,182 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-01-09 21:40:16,182 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-01-09 21:40:16,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [278#L697-3true, Black: 304#true, 298#true, 224#L712-1true, 251#L697-3true, 302#true, 309#true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:16,183 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2025-01-09 21:40:16,183 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-01-09 21:40:16,183 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-01-09 21:40:16,183 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-01-09 21:40:16,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [278#L697-3true, Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 300#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 125#L697-3true, 306#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:40:16,187 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2025-01-09 21:40:16,187 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-01-09 21:40:16,187 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-01-09 21:40:16,187 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-01-09 21:40:16,353 INFO L124 PetriNetUnfolderBase]: 38618/104949 cut-off events. [2025-01-09 21:40:16,353 INFO L125 PetriNetUnfolderBase]: For 40146/43704 co-relation queries the response was YES. [2025-01-09 21:40:16,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197504 conditions, 104949 events. 38618/104949 cut-off events. For 40146/43704 co-relation queries the response was YES. Maximal size of possible extension queue 3242. Compared 1446945 event pairs, 24931 based on Foata normal form. 604/95312 useless extension candidates. Maximal degree in co-relation 195212. Up to 46398 conditions per place. [2025-01-09 21:40:17,177 INFO L140 encePairwiseOnDemand]: 287/297 looper letters, 55 selfloop transitions, 16 changer transitions 0/334 dead transitions. [2025-01-09 21:40:17,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 334 transitions, 956 flow [2025-01-09 21:40:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 834 transitions. [2025-01-09 21:40:17,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936026936026936 [2025-01-09 21:40:17,179 INFO L175 Difference]: Start difference. First operand has 305 places, 308 transitions, 726 flow. Second operand 3 states and 834 transitions. [2025-01-09 21:40:17,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 334 transitions, 956 flow [2025-01-09 21:40:17,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 334 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:17,349 INFO L231 Difference]: Finished difference. Result has 306 places, 322 transitions, 844 flow [2025-01-09 21:40:17,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=306, PETRI_TRANSITIONS=322} [2025-01-09 21:40:17,350 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 5 predicate places. [2025-01-09 21:40:17,350 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 322 transitions, 844 flow [2025-01-09 21:40:17,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-01-09 21:40:17,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:17,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:17,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:40:17,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:40:17,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash -944371438, now seen corresponding path program 1 times [2025-01-09 21:40:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:17,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147558367] [2025-01-09 21:40:17,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:17,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:17,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:40:17,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:40:17,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:17,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:17,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147558367] [2025-01-09 21:40:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147558367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476570081] [2025-01-09 21:40:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:17,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:17,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:17,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:17,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 297 [2025-01-09 21:40:17,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 322 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 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-01-09 21:40:17,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:17,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 297 [2025-01-09 21:40:17,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:21,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 314#true, 224#L712-1true, 302#true, 190#$Ultimate##0true, 80#L695-1true, 309#true, Black: 311#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 244#L695-2true, 300#true]) [2025-01-09 21:40:21,094 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-01-09 21:40:21,094 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:21,094 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:21,094 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:21,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 314#true, 224#L712-1true, 302#true, 137#L695-1true, 190#$Ultimate##0true, 309#true, Black: 311#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 300#true, 226#L695-2true]) [2025-01-09 21:40:21,095 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-01-09 21:40:21,095 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:21,095 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:21,095 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:21,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 304#true, 298#true, 314#true, 224#L712-1true, 302#true, 190#$Ultimate##0true, 309#true, Black: 311#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 244#L695-2true, 300#true, 226#L695-2true]) [2025-01-09 21:40:21,265 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is cut-off event [2025-01-09 21:40:21,265 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-01-09 21:40:21,265 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-01-09 21:40:21,265 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event