./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/lamport-b.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-atomic/lamport-b.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 9bb446a7af732154870b2839e66288d9133e28dfbbe8fe81423789728796a44c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:03:39,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:03:39,538 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:03:39,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:03:39,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:03:39,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:03:39,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:03:39,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:03:39,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:03:39,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:03:39,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:03:39,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:03:39,577 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:03:39,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:03:39,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:03:39,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:03:39,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:03:39,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:03:39,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:03:39,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:03:39,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:03:39,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:03:39,578 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:03:39,579 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:03:39,579 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:03:39,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:03:39,579 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:03:39,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:03:39,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:03:39,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:03:39,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:03:39,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:39,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:03:39,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:03:39,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:03:39,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:39,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:03:39,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:03:39,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:03:39,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:03:39,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:03:39,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:03:39,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:03:39,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:03:39,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:03:39,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:03:39,582 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 -> 9bb446a7af732154870b2839e66288d9133e28dfbbe8fe81423789728796a44c [2025-01-09 21:03:39,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:03:39,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:03:39,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:03:39,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:03:39,873 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:03:39,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport-b.i [2025-01-09 21:03:41,309 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7e3675d6/4959b0d6909945258e1f4b6b53e029d6/FLAG9891e9873 [2025-01-09 21:03:41,598 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:03:41,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport-b.i [2025-01-09 21:03:41,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7e3675d6/4959b0d6909945258e1f4b6b53e029d6/FLAG9891e9873 [2025-01-09 21:03:41,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7e3675d6/4959b0d6909945258e1f4b6b53e029d6 [2025-01-09 21:03:41,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:03:41,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:03:41,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:03:41,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:03:41,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:03:41,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2aba0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:41, skipping insertion in model container [2025-01-09 21:03:41,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:41" (1/1) ... [2025-01-09 21:03:41,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:03:41,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:03:41,944 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:03:41,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:03:42,007 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:03:42,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42 WrapperNode [2025-01-09 21:03:42,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:03:42,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:03:42,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:03:42,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:03:42,014 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:03:42" (1/1) ... [2025-01-09 21:03:42,025 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:03:42" (1/1) ... [2025-01-09 21:03:42,047 INFO L138 Inliner]: procedures = 160, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 189 [2025-01-09 21:03:42,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:03:42,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:03:42,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:03:42,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:03:42,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:03:42,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:03:42,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:03:42,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:03:42,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (1/1) ... [2025-01-09 21:03:42,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:03:42,129 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:03:42,133 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:03:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-09 21:03:42,159 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-09 21:03:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:03:42,159 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:03:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:03:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:03:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:03:42,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:03:42,162 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:03:42,293 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:03:42,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:03:42,597 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:03:42,598 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:03:42,614 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:03:42,616 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-01-09 21:03:42,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:42 BoogieIcfgContainer [2025-01-09 21:03:42,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:03:42,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:03:42,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:03:42,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:03:42,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:03:41" (1/3) ... [2025-01-09 21:03:42,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e4e0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:42, skipping insertion in model container [2025-01-09 21:03:42,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:42" (2/3) ... [2025-01-09 21:03:42,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e4e0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:42, skipping insertion in model container [2025-01-09 21:03:42,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:42" (3/3) ... [2025-01-09 21:03:42,626 INFO L128 eAbstractionObserver]: Analyzing ICFG lamport-b.i [2025-01-09 21:03:42,640 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:03:42,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lamport-b.i that has 3 procedures, 204 locations, 1 initial locations, 8 loop locations, and 30 error locations. [2025-01-09 21:03:42,642 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:03:42,761 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:03:42,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 227 transitions, 468 flow [2025-01-09 21:03:42,889 INFO L124 PetriNetUnfolderBase]: 24/225 cut-off events. [2025-01-09 21:03:42,891 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:03:42,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 225 events. 24/225 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 696 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 202. Up to 5 conditions per place. [2025-01-09 21:03:42,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 227 transitions, 468 flow [2025-01-09 21:03:42,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 220 transitions, 449 flow [2025-01-09 21:03:42,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:03:42,937 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;@3bae25d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:03:42,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-01-09 21:03:42,949 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:03:42,951 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-01-09 21:03:42,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:03:42,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:42,953 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] [2025-01-09 21:03:42,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:42,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1098040549, now seen corresponding path program 1 times [2025-01-09 21:03:42,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:42,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855830533] [2025-01-09 21:03:42,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:42,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:43,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:03:43,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:03:43,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:43,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:43,158 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:03:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855830533] [2025-01-09 21:03:43,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855830533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:43,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675253065] [2025-01-09 21:03:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:43,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:03:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:43,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:03:43,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:03:43,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 227 [2025-01-09 21:03:43,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 220 transitions, 449 flow. Second operand has 2 states, 2 states have (on average 212.0) internal successors, (424), 2 states have internal predecessors, (424), 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:03:43,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:43,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 227 [2025-01-09 21:03:43,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:43,262 INFO L124 PetriNetUnfolderBase]: 12/206 cut-off events. [2025-01-09 21:03:43,263 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:03:43,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 12/206 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 513 event pairs, 0 based on Foata normal form. 19/181 useless extension candidates. Maximal degree in co-relation 189. Up to 4 conditions per place. [2025-01-09 21:03:43,268 INFO L140 encePairwiseOnDemand]: 215/227 looper letters, 3 selfloop transitions, 0 changer transitions 0/206 dead transitions. [2025-01-09 21:03:43,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 427 flow [2025-01-09 21:03:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:03:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:03:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 437 transitions. [2025-01-09 21:03:43,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625550660792952 [2025-01-09 21:03:43,285 INFO L175 Difference]: Start difference. First operand has 203 places, 220 transitions, 449 flow. Second operand 2 states and 437 transitions. [2025-01-09 21:03:43,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 427 flow [2025-01-09 21:03:43,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 206 transitions, 422 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:03:43,296 INFO L231 Difference]: Finished difference. Result has 199 places, 206 transitions, 416 flow [2025-01-09 21:03:43,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=416, PETRI_PLACES=199, PETRI_TRANSITIONS=206} [2025-01-09 21:03:43,303 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, -4 predicate places. [2025-01-09 21:03:43,303 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 206 transitions, 416 flow [2025-01-09 21:03:43,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 212.0) internal successors, (424), 2 states have internal predecessors, (424), 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:03:43,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:43,304 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] [2025-01-09 21:03:43,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:03:43,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:43,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1097086243, now seen corresponding path program 1 times [2025-01-09 21:03:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697159279] [2025-01-09 21:03:43,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:43,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:43,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:03:43,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:03:43,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:43,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:43,386 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:03:43,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:43,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697159279] [2025-01-09 21:03:43,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697159279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:43,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:43,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:43,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435158047] [2025-01-09 21:03:43,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:43,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:43,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:43,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:43,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 227 [2025-01-09 21:03:43,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 206 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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:03:43,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:43,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 227 [2025-01-09 21:03:43,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:43,528 INFO L124 PetriNetUnfolderBase]: 52/573 cut-off events. [2025-01-09 21:03:43,528 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:03:43,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 573 events. 52/573 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2816 event pairs, 11 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 639. Up to 41 conditions per place. [2025-01-09 21:03:43,539 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 12 selfloop transitions, 4 changer transitions 0/210 dead transitions. [2025-01-09 21:03:43,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 210 transitions, 458 flow [2025-01-09 21:03:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-01-09 21:03:43,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9148311306901615 [2025-01-09 21:03:43,549 INFO L175 Difference]: Start difference. First operand has 199 places, 206 transitions, 416 flow. Second operand 3 states and 623 transitions. [2025-01-09 21:03:43,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 210 transitions, 458 flow [2025-01-09 21:03:43,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 210 transitions, 458 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:03:43,556 INFO L231 Difference]: Finished difference. Result has 203 places, 209 transitions, 446 flow [2025-01-09 21:03:43,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=203, PETRI_TRANSITIONS=209} [2025-01-09 21:03:43,559 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 0 predicate places. [2025-01-09 21:03:43,559 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 209 transitions, 446 flow [2025-01-09 21:03:43,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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:03:43,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:43,561 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] [2025-01-09 21:03:43,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:03:43,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:43,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2110531840, now seen corresponding path program 1 times [2025-01-09 21:03:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910339162] [2025-01-09 21:03:43,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:43,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:03:43,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:03:43,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:43,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:43,616 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:03:43,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:43,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910339162] [2025-01-09 21:03:43,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910339162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:43,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:43,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:43,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358161191] [2025-01-09 21:03:43,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:43,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:43,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:43,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:43,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:43,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 227 [2025-01-09 21:03:43,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 209 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:03:43,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:43,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 227 [2025-01-09 21:03:43,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:43,802 INFO L124 PetriNetUnfolderBase]: 91/1009 cut-off events. [2025-01-09 21:03:43,802 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:03:43,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 1009 events. 91/1009 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6574 event pairs, 13 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 1139. Up to 56 conditions per place. [2025-01-09 21:03:43,812 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 11 selfloop transitions, 5 changer transitions 0/214 dead transitions. [2025-01-09 21:03:43,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 214 transitions, 490 flow [2025-01-09 21:03:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-01-09 21:03:43,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192364170337739 [2025-01-09 21:03:43,815 INFO L175 Difference]: Start difference. First operand has 203 places, 209 transitions, 446 flow. Second operand 3 states and 626 transitions. [2025-01-09 21:03:43,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 214 transitions, 490 flow [2025-01-09 21:03:43,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 214 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:43,822 INFO L231 Difference]: Finished difference. Result has 205 places, 213 transitions, 476 flow [2025-01-09 21:03:43,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=205, PETRI_TRANSITIONS=213} [2025-01-09 21:03:43,824 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 2 predicate places. [2025-01-09 21:03:43,824 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 213 transitions, 476 flow [2025-01-09 21:03:43,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:03:43,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:43,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:43,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:03:43,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:43,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash -333353189, now seen corresponding path program 1 times [2025-01-09 21:03:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:43,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750474570] [2025-01-09 21:03:43,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:43,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:03:43,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:03:43,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:43,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:43,917 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:03:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750474570] [2025-01-09 21:03:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750474570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:43,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:43,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:43,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450545872] [2025-01-09 21:03:43,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:43,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:43,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:43,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:43,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:43,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 227 [2025-01-09 21:03:43,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 213 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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:03:43,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:43,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 227 [2025-01-09 21:03:43,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:44,148 INFO L124 PetriNetUnfolderBase]: 103/1105 cut-off events. [2025-01-09 21:03:44,148 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2025-01-09 21:03:44,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 1105 events. 103/1105 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7805 event pairs, 21 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1301. Up to 71 conditions per place. [2025-01-09 21:03:44,159 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 12 selfloop transitions, 4 changer transitions 0/217 dead transitions. [2025-01-09 21:03:44,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 217 transitions, 517 flow [2025-01-09 21:03:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-01-09 21:03:44,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9148311306901615 [2025-01-09 21:03:44,162 INFO L175 Difference]: Start difference. First operand has 205 places, 213 transitions, 476 flow. Second operand 3 states and 623 transitions. [2025-01-09 21:03:44,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 217 transitions, 517 flow [2025-01-09 21:03:44,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 217 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:44,168 INFO L231 Difference]: Finished difference. Result has 207 places, 216 transitions, 496 flow [2025-01-09 21:03:44,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=207, PETRI_TRANSITIONS=216} [2025-01-09 21:03:44,169 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 4 predicate places. [2025-01-09 21:03:44,170 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 216 transitions, 496 flow [2025-01-09 21:03:44,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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:03:44,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:44,170 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] [2025-01-09 21:03:44,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:03:44,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:44,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:44,171 INFO L85 PathProgramCache]: Analyzing trace with hash 828504458, now seen corresponding path program 1 times [2025-01-09 21:03:44,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:44,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878602701] [2025-01-09 21:03:44,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:44,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:44,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:03:44,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:03:44,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:44,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:44,241 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:03:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878602701] [2025-01-09 21:03:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878602701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:44,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:44,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458392898] [2025-01-09 21:03:44,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:44,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:44,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:44,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:44,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 227 [2025-01-09 21:03:44,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 216 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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:03:44,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:44,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 227 [2025-01-09 21:03:44,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:44,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][53], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 211#true, 225#true, 162#L706-3true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 213#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 45#L680-3true, 232#(= |#race~y~0| 0)]) [2025-01-09 21:03:44,633 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:03:44,634 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:03:44,634 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-01-09 21:03:44,634 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-01-09 21:03:44,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][53], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 211#true, 225#true, 154#L680-4true, 162#L706-3true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 213#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 232#(= |#race~y~0| 0)]) [2025-01-09 21:03:44,644 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:03:44,644 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-01-09 21:03:44,644 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-01-09 21:03:44,644 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-01-09 21:03:44,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][54], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 211#true, 40#L681true, 225#true, 162#L706-3true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 213#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 232#(= |#race~y~0| 0)]) [2025-01-09 21:03:44,652 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:03:44,652 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:44,652 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:03:44,652 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:44,733 INFO L124 PetriNetUnfolderBase]: 467/3526 cut-off events. [2025-01-09 21:03:44,734 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:03:44,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 3526 events. 467/3526 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 33803 event pairs, 80 based on Foata normal form. 0/2803 useless extension candidates. Maximal degree in co-relation 4583. Up to 431 conditions per place. [2025-01-09 21:03:44,757 INFO L140 encePairwiseOnDemand]: 199/227 looper letters, 33 selfloop transitions, 20 changer transitions 0/238 dead transitions. [2025-01-09 21:03:44,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 238 transitions, 649 flow [2025-01-09 21:03:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2025-01-09 21:03:44,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.895741556534508 [2025-01-09 21:03:44,765 INFO L175 Difference]: Start difference. First operand has 207 places, 216 transitions, 496 flow. Second operand 3 states and 610 transitions. [2025-01-09 21:03:44,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 238 transitions, 649 flow [2025-01-09 21:03:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 238 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:44,773 INFO L231 Difference]: Finished difference. Result has 209 places, 236 transitions, 664 flow [2025-01-09 21:03:44,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=209, PETRI_TRANSITIONS=236} [2025-01-09 21:03:44,774 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 6 predicate places. [2025-01-09 21:03:44,774 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 236 transitions, 664 flow [2025-01-09 21:03:44,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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:03:44,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:44,775 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] [2025-01-09 21:03:44,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:03:44,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:44,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 981701410, now seen corresponding path program 1 times [2025-01-09 21:03:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:44,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54251377] [2025-01-09 21:03:44,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:44,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:03:44,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:03:44,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:44,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:44,840 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:03:44,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:44,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54251377] [2025-01-09 21:03:44,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54251377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:44,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:44,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652079162] [2025-01-09 21:03:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:44,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:44,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:44,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:44,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:44,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 227 [2025-01-09 21:03:44,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 236 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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:03:44,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:44,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 227 [2025-01-09 21:03:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:45,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L680-2-->L680-3: Formula: (= |v_#race~x~0_7| |v_thr1Thread1of1ForFork0_#t~nondet2#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~x~0][56], [211#true, 235#true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 213#true, Black: 230#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 45#L680-3true, 176#L706-4true, 232#(= |#race~y~0| 0), Black: 220#true]) [2025-01-09 21:03:45,080 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-01-09 21:03:45,081 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-01-09 21:03:45,081 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-01-09 21:03:45,081 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-01-09 21:03:45,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L680-2-->L680-3: Formula: (= |v_#race~x~0_7| |v_thr1Thread1of1ForFork0_#t~nondet2#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~x~0][40], [136#L707true, 211#true, 235#true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 213#true, Black: 230#true, 45#L680-3true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 220#true, 232#(= |#race~y~0| 0)]) [2025-01-09 21:03:45,207 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:03:45,207 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-01-09 21:03:45,207 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:45,207 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:45,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L680-2-->L680-3: Formula: (= |v_#race~x~0_7| |v_thr1Thread1of1ForFork0_#t~nondet2#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~x~0][40], [211#true, 235#true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 213#true, Black: 230#true, 45#L680-3true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 173#L706-2true, Black: 220#true, 232#(= |#race~y~0| 0)]) [2025-01-09 21:03:45,207 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:03:45,207 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2025-01-09 21:03:45,207 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2025-01-09 21:03:45,208 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:03:45,208 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([672] L680-2-->L680-3: Formula: (= |v_#race~x~0_7| |v_thr1Thread1of1ForFork0_#t~nondet2#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~x~0][56], [211#true, 235#true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 213#true, Black: 230#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 45#L680-3true, 176#L706-4true, Black: 220#true, 232#(= |#race~y~0| 0)]) [2025-01-09 21:03:45,208 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:03:45,208 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-01-09 21:03:45,208 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-01-09 21:03:45,208 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-01-09 21:03:45,208 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-01-09 21:03:45,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L680-2-->L680-3: Formula: (= |v_#race~x~0_7| |v_thr1Thread1of1ForFork0_#t~nondet2#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~x~0][56], [211#true, 235#true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 162#L706-3true, 165#L732-4true, 213#true, Black: 230#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 45#L680-3true, 232#(= |#race~y~0| 0), Black: 220#true]) [2025-01-09 21:03:45,208 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:03:45,209 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-01-09 21:03:45,209 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:03:45,209 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-01-09 21:03:45,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L706-1-->L706-2: Formula: true InVars {} OutVars{thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#t~nondet10#1][49], [211#true, 235#true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 213#true, Black: 230#true, 45#L680-3true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 173#L706-2true, Black: 220#true, 232#(= |#race~y~0| 0)]) [2025-01-09 21:03:45,218 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:03:45,218 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2025-01-09 21:03:45,218 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2025-01-09 21:03:45,219 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:03:45,304 INFO L124 PetriNetUnfolderBase]: 497/3818 cut-off events. [2025-01-09 21:03:45,304 INFO L125 PetriNetUnfolderBase]: For 249/267 co-relation queries the response was YES. [2025-01-09 21:03:45,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5261 conditions, 3818 events. 497/3818 cut-off events. For 249/267 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37266 event pairs, 94 based on Foata normal form. 0/3062 useless extension candidates. Maximal degree in co-relation 5253. Up to 414 conditions per place. [2025-01-09 21:03:45,336 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 12 selfloop transitions, 6 changer transitions 0/241 dead transitions. [2025-01-09 21:03:45,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 241 transitions, 713 flow [2025-01-09 21:03:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-01-09 21:03:45,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192364170337739 [2025-01-09 21:03:45,339 INFO L175 Difference]: Start difference. First operand has 209 places, 236 transitions, 664 flow. Second operand 3 states and 626 transitions. [2025-01-09 21:03:45,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 241 transitions, 713 flow [2025-01-09 21:03:45,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 241 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:45,351 INFO L231 Difference]: Finished difference. Result has 211 places, 240 transitions, 668 flow [2025-01-09 21:03:45,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=211, PETRI_TRANSITIONS=240} [2025-01-09 21:03:45,354 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 8 predicate places. [2025-01-09 21:03:45,354 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 240 transitions, 668 flow [2025-01-09 21:03:45,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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:03:45,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:45,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:45,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:03:45,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2120495182, now seen corresponding path program 1 times [2025-01-09 21:03:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998023519] [2025-01-09 21:03:45,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:45,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:03:45,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:03:45,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:45,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:45,427 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:03:45,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:45,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998023519] [2025-01-09 21:03:45,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998023519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:45,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:45,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:03:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450718466] [2025-01-09 21:03:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:45,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:45,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:45,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:45,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:45,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 227 [2025-01-09 21:03:45,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 240 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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:03:45,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:45,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 227 [2025-01-09 21:03:45,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:45,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([604] L712-2-->L712-3: Formula: (= |v_#race~y~0_10| |v_thr2Thread1of1ForFork1_#t~nondet12#1_3|) InVars {thr2Thread1of1ForFork1_#t~nondet12#1=|v_thr2Thread1of1ForFork1_#t~nondet12#1_3|} OutVars{#race~y~0=|v_#race~y~0_10|, thr2Thread1of1ForFork1_#t~nondet12#1=|v_thr2Thread1of1ForFork1_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~y~0][73], [211#true, Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 235#true, 240#true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 138#L691-1true, 157#L712-3true, 213#true, Black: 232#(= |#race~y~0| 0), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|)]) [2025-01-09 21:03:45,863 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-01-09 21:03:45,863 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:45,863 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:45,863 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:45,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L691-2-->L691-5: Formula: (= v_~y~0_19 0) InVars {~y~0=v_~y~0_19} OutVars{~y~0=v_~y~0_19} AuxVars[] AssignedVars[][156], [211#true, Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 235#true, 194#L691-5true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 78#L712-1true, 165#L732-4true, 213#true, Black: 230#true, 242#(= ~y~0 0), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|)]) [2025-01-09 21:03:45,873 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-01-09 21:03:45,873 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:45,873 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:45,874 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:45,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([744] L691-2-->L691-3: Formula: (not (= v_~y~0_18 0)) InVars {~y~0=v_~y~0_18} OutVars{~y~0=v_~y~0_18} AuxVars[] AssignedVars[][157], [211#true, Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 235#true, 240#true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 78#L712-1true, 165#L732-4true, 213#true, Black: 230#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 202#L691-3true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|)]) [2025-01-09 21:03:45,874 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-01-09 21:03:45,874 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:45,874 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:45,874 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:45,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([604] L712-2-->L712-3: Formula: (= |v_#race~y~0_10| |v_thr2Thread1of1ForFork1_#t~nondet12#1_3|) InVars {thr2Thread1of1ForFork1_#t~nondet12#1=|v_thr2Thread1of1ForFork1_#t~nondet12#1_3|} OutVars{#race~y~0=|v_#race~y~0_10|, thr2Thread1of1ForFork1_#t~nondet12#1=|v_thr2Thread1of1ForFork1_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~y~0][73], [211#true, Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 170#L691-2true, 235#true, 240#true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 157#L712-3true, 213#true, Black: 232#(= |#race~y~0| 0), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|)]) [2025-01-09 21:03:45,874 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:03:45,874 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:03:45,874 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:45,874 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:03:45,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][52], [211#true, Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 40#L681true, 162#L706-3true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 165#L732-4true, 213#true, 242#(= ~y~0 0), Black: 230#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), Black: 235#true]) [2025-01-09 21:03:45,946 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:03:45,946 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:45,946 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:45,946 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:03:45,965 INFO L124 PetriNetUnfolderBase]: 690/5246 cut-off events. [2025-01-09 21:03:45,966 INFO L125 PetriNetUnfolderBase]: For 235/249 co-relation queries the response was YES. [2025-01-09 21:03:45,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7414 conditions, 5246 events. 690/5246 cut-off events. For 235/249 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 57128 event pairs, 107 based on Foata normal form. 31/4298 useless extension candidates. Maximal degree in co-relation 7405. Up to 540 conditions per place. [2025-01-09 21:03:46,004 INFO L140 encePairwiseOnDemand]: 208/227 looper letters, 23 selfloop transitions, 11 changer transitions 0/252 dead transitions. [2025-01-09 21:03:46,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 252 transitions, 763 flow [2025-01-09 21:03:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-01-09 21:03:46,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074889867841409 [2025-01-09 21:03:46,007 INFO L175 Difference]: Start difference. First operand has 211 places, 240 transitions, 668 flow. Second operand 3 states and 618 transitions. [2025-01-09 21:03:46,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 252 transitions, 763 flow [2025-01-09 21:03:46,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 252 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:46,015 INFO L231 Difference]: Finished difference. Result has 213 places, 250 transitions, 756 flow [2025-01-09 21:03:46,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=213, PETRI_TRANSITIONS=250} [2025-01-09 21:03:46,017 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 10 predicate places. [2025-01-09 21:03:46,017 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 250 transitions, 756 flow [2025-01-09 21:03:46,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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:03:46,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:46,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:46,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:03:46,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:46,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2121449488, now seen corresponding path program 1 times [2025-01-09 21:03:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642271919] [2025-01-09 21:03:46,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:46,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:03:46,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:03:46,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:46,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:46,055 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:03:46,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:46,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642271919] [2025-01-09 21:03:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642271919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:46,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:46,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702880673] [2025-01-09 21:03:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:46,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:46,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:46,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:46,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 227 [2025-01-09 21:03:46,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 250 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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:03:46,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:46,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 227 [2025-01-09 21:03:46,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:46,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][52], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 162#L706-3true, 213#true, Black: 230#true, Black: 235#true, 211#true, 40#L681true, Black: 240#true, 165#L732-4true, 242#(= ~y~0 0), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|)]) [2025-01-09 21:03:46,600 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:03:46,601 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:46,601 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:03:46,601 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:46,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([649] L717-2-->L717-5: Formula: (= v_~y~0_9 0) InVars {~y~0=v_~y~0_9} OutVars{~y~0=v_~y~0_9} AuxVars[] AssignedVars[][253], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 137#L717-5true, 213#true, Black: 230#true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, 242#(= ~y~0 0), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true]) [2025-01-09 21:03:46,677 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-01-09 21:03:46,677 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:46,677 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:46,677 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:03:46,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([683] L699-1-->L699-2: Formula: (= |v_#race~y~0_19| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_19|, thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][230], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 145#L717-2true, 213#true, Black: 232#(= |#race~y~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, 242#(= ~y~0 0), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 178#L699-2true]) [2025-01-09 21:03:46,679 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-01-09 21:03:46,679 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:03:46,679 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:03:46,679 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:03:46,684 INFO L124 PetriNetUnfolderBase]: 782/5539 cut-off events. [2025-01-09 21:03:46,684 INFO L125 PetriNetUnfolderBase]: For 817/982 co-relation queries the response was YES. [2025-01-09 21:03:46,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8661 conditions, 5539 events. 782/5539 cut-off events. For 817/982 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 60660 event pairs, 125 based on Foata normal form. 7/4594 useless extension candidates. Maximal degree in co-relation 8651. Up to 666 conditions per place. [2025-01-09 21:03:46,716 INFO L140 encePairwiseOnDemand]: 217/227 looper letters, 30 selfloop transitions, 15 changer transitions 0/264 dead transitions. [2025-01-09 21:03:46,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 264 transitions, 898 flow [2025-01-09 21:03:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-01-09 21:03:46,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9016152716593245 [2025-01-09 21:03:46,718 INFO L175 Difference]: Start difference. First operand has 213 places, 250 transitions, 756 flow. Second operand 3 states and 614 transitions. [2025-01-09 21:03:46,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 264 transitions, 898 flow [2025-01-09 21:03:46,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 264 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:46,726 INFO L231 Difference]: Finished difference. Result has 215 places, 263 transitions, 870 flow [2025-01-09 21:03:46,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=215, PETRI_TRANSITIONS=263} [2025-01-09 21:03:46,727 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 12 predicate places. [2025-01-09 21:03:46,727 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 263 transitions, 870 flow [2025-01-09 21:03:46,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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:03:46,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:46,728 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] [2025-01-09 21:03:46,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:03:46,728 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:46,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash -341329672, now seen corresponding path program 1 times [2025-01-09 21:03:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:46,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157252772] [2025-01-09 21:03:46,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:46,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:46,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:03:46,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:03:46,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:46,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:46,758 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:03:46,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157252772] [2025-01-09 21:03:46,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157252772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:46,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:46,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520857508] [2025-01-09 21:03:46,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:46,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:46,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:46,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:46,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:46,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 227 [2025-01-09 21:03:46,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 263 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:03:46,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:46,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 227 [2025-01-09 21:03:46,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:47,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][226], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, 28#L712true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true]) [2025-01-09 21:03:47,187 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:03:47,187 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:47,187 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:47,187 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:47,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][122], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 78#L712-1true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true]) [2025-01-09 21:03:47,188 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:03:47,188 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:47,188 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:47,188 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:47,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][122], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 181#L708true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true]) [2025-01-09 21:03:47,188 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:03:47,188 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:47,188 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:47,188 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:47,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L707-2-->L712: Formula: (= v_~y~0_5 0) InVars {~y~0=v_~y~0_5} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[][62], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 28#L712true, 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true]) [2025-01-09 21:03:47,226 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:03:47,226 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:47,226 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:47,226 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:47,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][226], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 137#L717-5true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true]) [2025-01-09 21:03:47,226 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-01-09 21:03:47,227 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,227 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,227 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([683] L699-1-->L699-2: Formula: (= |v_#race~y~0_19| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_19|, thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][208], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 190#L707-2true, 213#true, Black: 232#(= |#race~y~0| 0), 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 178#L699-2true]) [2025-01-09 21:03:47,260 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:03:47,260 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:47,260 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:47,260 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:47,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][101], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), 54#L706true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|)]) [2025-01-09 21:03:47,283 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:03:47,283 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,283 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,283 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,291 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][226], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 137#L717-5true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true]) [2025-01-09 21:03:47,292 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,292 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:03:47,292 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,292 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,292 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] L705-1-->L705-2: Formula: (= |v_#race~b2~0_1| |v_thr2Thread1of1ForFork1_#t~nondet9#1_3|) InVars {thr2Thread1of1ForFork1_#t~nondet9#1=|v_thr2Thread1of1ForFork1_#t~nondet9#1_3|} OutVars{#race~b2~0=|v_#race~b2~0_1|, thr2Thread1of1ForFork1_#t~nondet9#1=|v_thr2Thread1of1ForFork1_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~b2~0][41], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 225#true, 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, 17#L705-2true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|)]) [2025-01-09 21:03:47,341 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,341 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,341 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,341 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][92], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 162#L706-3true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, 47#L687-2true, Black: 230#true, Black: 235#true, 211#true, Black: 240#true, 165#L732-4true, 250#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|)]) [2025-01-09 21:03:47,362 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:03:47,362 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:47,362 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:47,362 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:47,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][135], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, 17#L705-2true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|)]) [2025-01-09 21:03:47,364 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,364 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,364 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,366 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([634] L715-3-->L715-1: Formula: (= |v_#race~b1~0_1| 0) InVars {} OutVars{#race~b1~0=|v_#race~b1~0_1|} AuxVars[] AssignedVars[#race~b1~0][138], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 22#L680true, 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|)]) [2025-01-09 21:03:47,464 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:03:47,464 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,464 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:03:47,464 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][135], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 164#L705-3true, 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|)]) [2025-01-09 21:03:47,468 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:03:47,468 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:47,468 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:47,468 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:47,474 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][135], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, 17#L705-2true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 245#true]) [2025-01-09 21:03:47,474 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,474 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,474 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,474 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,474 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,474 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][135], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 164#L705-3true, 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 245#true]) [2025-01-09 21:03:47,474 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:03:47,475 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:03:47,475 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:47,475 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:47,475 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:47,475 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][101], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), 54#L706true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 245#true]) [2025-01-09 21:03:47,475 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:03:47,475 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,475 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:03:47,475 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,475 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([578] L724-5-->L725: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][228], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 194#L691-5true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 48#L725true, 245#true]) [2025-01-09 21:03:47,477 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-01-09 21:03:47,477 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,477 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,478 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,486 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][101], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), 54#L706true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|)]) [2025-01-09 21:03:47,487 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:03:47,487 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,487 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:03:47,487 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:03:47,487 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,487 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:47,492 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([562] L705-1-->L705-2: Formula: (= |v_#race~b2~0_1| |v_thr2Thread1of1ForFork1_#t~nondet9#1_3|) InVars {thr2Thread1of1ForFork1_#t~nondet9#1=|v_thr2Thread1of1ForFork1_#t~nondet9#1_3|} OutVars{#race~b2~0=|v_#race~b2~0_1|, thr2Thread1of1ForFork1_#t~nondet9#1=|v_thr2Thread1of1ForFork1_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~b2~0][41], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 225#true, 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, 17#L705-2true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 245#true]) [2025-01-09 21:03:47,492 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,492 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,492 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,492 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,492 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][92], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 162#L706-3true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, Black: 235#true, 211#true, Black: 240#true, 165#L732-4true, 250#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 19#L687-1true]) [2025-01-09 21:03:47,501 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-01-09 21:03:47,501 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:03:47,501 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:03:47,501 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:03:47,513 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][92], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 162#L706-3true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 47#L687-2true, 213#true, Black: 230#true, Black: 235#true, 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 250#true, 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|)]) [2025-01-09 21:03:47,514 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:03:47,514 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:47,514 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:47,514 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:47,514 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:03:47,520 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][226], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 137#L717-5true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 245#true, 196#L699true]) [2025-01-09 21:03:47,520 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,520 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:03:47,520 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,521 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,521 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,521 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:47,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([649] L717-2-->L717-5: Formula: (= v_~y~0_9 0) InVars {~y~0=v_~y~0_9} OutVars{~y~0=v_~y~0_9} AuxVars[] AssignedVars[][260], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 137#L717-5true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true]) [2025-01-09 21:03:47,591 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-01-09 21:03:47,591 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:03:47,591 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,591 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:47,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([683] L699-1-->L699-2: Formula: (= |v_#race~y~0_19| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_19|, thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][208], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 145#L717-2true, 213#true, Black: 232#(= |#race~y~0| 0), 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 245#true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 178#L699-2true]) [2025-01-09 21:03:47,593 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-01-09 21:03:47,593 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:03:47,593 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:03:47,593 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:03:47,598 INFO L124 PetriNetUnfolderBase]: 1159/7688 cut-off events. [2025-01-09 21:03:47,598 INFO L125 PetriNetUnfolderBase]: For 1267/1348 co-relation queries the response was YES. [2025-01-09 21:03:47,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11975 conditions, 7688 events. 1159/7688 cut-off events. For 1267/1348 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 91256 event pairs, 161 based on Foata normal form. 8/6364 useless extension candidates. Maximal degree in co-relation 11964. Up to 882 conditions per place. [2025-01-09 21:03:47,634 INFO L140 encePairwiseOnDemand]: 219/227 looper letters, 15 selfloop transitions, 10 changer transitions 0/273 dead transitions. [2025-01-09 21:03:47,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 273 transitions, 963 flow [2025-01-09 21:03:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2025-01-09 21:03:47,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9251101321585903 [2025-01-09 21:03:47,636 INFO L175 Difference]: Start difference. First operand has 215 places, 263 transitions, 870 flow. Second operand 3 states and 630 transitions. [2025-01-09 21:03:47,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 273 transitions, 963 flow [2025-01-09 21:03:47,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 273 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:47,647 INFO L231 Difference]: Finished difference. Result has 217 places, 271 transitions, 936 flow [2025-01-09 21:03:47,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=217, PETRI_TRANSITIONS=271} [2025-01-09 21:03:47,647 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 14 predicate places. [2025-01-09 21:03:47,647 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 271 transitions, 936 flow [2025-01-09 21:03:47,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:03:47,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:47,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:47,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:03:47,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr2Err5ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash 656980018, now seen corresponding path program 1 times [2025-01-09 21:03:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825345278] [2025-01-09 21:03:47,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:47,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:03:47,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:03:47,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:47,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:47,684 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:03:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825345278] [2025-01-09 21:03:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825345278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:47,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:47,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:47,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867635951] [2025-01-09 21:03:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:47,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:47,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:47,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:47,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:47,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 227 [2025-01-09 21:03:47,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 271 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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:03:47,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:47,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 227 [2025-01-09 21:03:47,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:48,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][231], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 28#L712true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true, Black: 250#true]) [2025-01-09 21:03:48,104 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][119], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 181#L708true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true, Black: 250#true]) [2025-01-09 21:03:48,104 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][119], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 78#L712-1true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true, 196#L699true]) [2025-01-09 21:03:48,104 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,104 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([578] L724-5-->L725: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][175], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 15#L682true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, 48#L725true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,109 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:03:48,110 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,110 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,110 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([578] L724-5-->L725: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][233], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 26#L686true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, 48#L725true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,110 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:03:48,110 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,110 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,110 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L707-2-->L712: Formula: (= v_~y~0_5 0) InVars {~y~0=v_~y~0_5} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[][63], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 28#L712true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true, Black: 250#true]) [2025-01-09 21:03:48,123 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:03:48,123 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,123 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,123 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][231], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 137#L717-5true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 196#L699true, Black: 250#true]) [2025-01-09 21:03:48,123 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-01-09 21:03:48,123 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,123 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,123 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] L681-2-->L686: Formula: (= v_~y~0_15 0) InVars {~y~0=v_~y~0_15} OutVars{~y~0=v_~y~0_15} AuxVars[] AssignedVars[][50], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 26#L686true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, 48#L725true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,130 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:03:48,130 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,130 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,130 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-01-09 21:03:48,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([578] L724-5-->L725: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][233], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 194#L691-5true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 48#L725true, Black: 250#true]) [2025-01-09 21:03:48,146 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,146 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,146 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,146 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([683] L699-1-->L699-2: Formula: (= |v_#race~y~0_19| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_19|, thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][210], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 190#L707-2true, 213#true, Black: 232#(= |#race~y~0| 0), 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true, 178#L699-2true]) [2025-01-09 21:03:48,147 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:03:48,147 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,147 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,147 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([578] L724-5-->L725: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][175], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 110#L686-1true, Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, 48#L725true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,150 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:03:48,150 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,151 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,151 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] L725-1-->L725-2: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet15#1_3| |v_#race~y~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet15#1=|v_thr2Thread1of1ForFork1_#t~nondet15#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, thr2Thread1of1ForFork1_#t~nondet15#1=|v_thr2Thread1of1ForFork1_#t~nondet15#1_3|} AuxVars[] AssignedVars[#race~y~0][214], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 33#L725-2true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 77#L681-2true, 213#true, Black: 232#(= |#race~y~0| 0), 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,153 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:03:48,153 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,153 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,154 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:03:48,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([634] L715-3-->L715-1: Formula: (= |v_#race~b1~0_1| 0) InVars {} OutVars{#race~b1~0=|v_#race~b1~0_1|} AuxVars[] AssignedVars[#race~b1~0][136], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), Black: 230#true, 213#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, 22#L680true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,160 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:03:48,160 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,160 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,160 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][97], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), 54#L706true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,164 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:03:48,164 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,164 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,164 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,169 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][231], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 137#L717-5true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true, 196#L699true]) [2025-01-09 21:03:48,170 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,170 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,170 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,170 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:03:48,170 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] L679-1-->L679-2: Formula: (= |v_#race~b1~0_4| |v_thr1Thread1of1ForFork0_#t~nondet1#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet1#1=|v_thr1Thread1of1ForFork0_#t~nondet1#1_3|} OutVars{#race~b1~0=|v_#race~b1~0_4|, thr1Thread1of1ForFork0_#t~nondet1#1=|v_thr1Thread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[#race~b1~0][28], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 61#L679-2true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 215#true, Black: 250#true]) [2025-01-09 21:03:48,181 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,181 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,181 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,181 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([634] L715-3-->L715-1: Formula: (= |v_#race~b1~0_1| 0) InVars {} OutVars{#race~b1~0=|v_#race~b1~0_1|} AuxVars[] AssignedVars[#race~b1~0][135], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 61#L679-2true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,200 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,200 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,200 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,200 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] L705-1-->L705-2: Formula: (= |v_#race~b2~0_1| |v_thr2Thread1of1ForFork1_#t~nondet9#1_3|) InVars {thr2Thread1of1ForFork1_#t~nondet9#1=|v_thr2Thread1of1ForFork1_#t~nondet9#1_3|} OutVars{#race~b2~0=|v_#race~b2~0_1|, thr2Thread1of1ForFork1_#t~nondet9#1=|v_thr2Thread1of1ForFork1_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~b2~0][41], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 225#true, 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, 17#L705-2true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,206 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,206 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,206 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,206 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L680-2-->L680-3: Formula: (= |v_#race~x~0_7| |v_thr1Thread1of1ForFork0_#t~nondet2#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~x~0][91], [Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, 57#L713-2true, Black: 240#true, 255#true, 165#L732-4true, 250#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 45#L680-3true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 252#(= |#race~x~0| 0), Black: 220#true]) [2025-01-09 21:03:48,218 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:03:48,218 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,218 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,218 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([634] L715-3-->L715-1: Formula: (= |v_#race~b1~0_1| 0) InVars {} OutVars{#race~b1~0=|v_#race~b1~0_1|} AuxVars[] AssignedVars[#race~b1~0][135], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 82#L679-3true, Black: 250#true]) [2025-01-09 21:03:48,220 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:03:48,220 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,220 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,220 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][127], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 162#L706-3true, 213#true, 47#L687-2true, Black: 230#true, Black: 235#true, 211#true, Black: 240#true, 255#true, 165#L732-4true, 250#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 252#(= |#race~x~0| 0)]) [2025-01-09 21:03:48,225 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:03:48,225 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,225 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,225 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][99], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, 17#L705-2true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,227 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,227 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,227 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,228 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,243 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([634] L715-3-->L715-1: Formula: (= |v_#race~b1~0_1| 0) InVars {} OutVars{#race~b1~0=|v_#race~b1~0_1|} AuxVars[] AssignedVars[#race~b1~0][136], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 22#L680true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,243 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:03:48,243 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,243 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,243 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,243 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:03:48,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][99], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 164#L705-3true, 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,249 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:03:48,249 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,249 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,249 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,253 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([634] L715-3-->L715-1: Formula: (= |v_#race~b1~0_1| 0) InVars {} OutVars{#race~b1~0=|v_#race~b1~0_1|} AuxVars[] AssignedVars[#race~b1~0][135], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 82#L679-3true, Black: 250#true]) [2025-01-09 21:03:48,253 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:03:48,253 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,253 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,253 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,253 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:03:48,253 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([634] L715-3-->L715-1: Formula: (= |v_#race~b1~0_1| 0) InVars {} OutVars{#race~b1~0=|v_#race~b1~0_1|} AuxVars[] AssignedVars[#race~b1~0][135], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 61#L679-2true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,253 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,253 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,254 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,254 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,254 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,254 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([634] L715-3-->L715-1: Formula: (= |v_#race~b1~0_1| 0) InVars {} OutVars{#race~b1~0=|v_#race~b1~0_1|} AuxVars[] AssignedVars[#race~b1~0][136], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 22#L680true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,254 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:03:48,254 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,254 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,254 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,254 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:03:48,254 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:03:48,256 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][99], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 164#L705-3true, 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,256 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:03:48,256 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,256 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,256 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:03:48,256 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][99], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, 17#L705-2true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,257 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][97], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), 54#L706true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,257 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,257 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,260 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([578] L724-5-->L725: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][233], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 194#L691-5true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, 48#L725true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,260 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-01-09 21:03:48,260 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,260 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,260 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,260 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,270 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([730] L689-3-->L689-1: Formula: (= |v_#race~b2~0_13| 0) InVars {} OutVars{#race~b2~0=|v_#race~b2~0_13|} AuxVars[] AssignedVars[#race~b2~0][97], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), 54#L706true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,270 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:03:48,270 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,270 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:03:48,270 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,270 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:03:48,270 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:03:48,273 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([658] L679-1-->L679-2: Formula: (= |v_#race~b1~0_4| |v_thr1Thread1of1ForFork0_#t~nondet1#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet1#1=|v_thr1Thread1of1ForFork0_#t~nondet1#1_3|} OutVars{#race~b1~0=|v_#race~b1~0_4|, thr1Thread1of1ForFork0_#t~nondet1#1=|v_thr1Thread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[#race~b1~0][28], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 99#L715-1true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 61#L679-2true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 215#true, Black: 250#true]) [2025-01-09 21:03:48,273 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,273 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,273 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,273 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,273 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,274 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([562] L705-1-->L705-2: Formula: (= |v_#race~b2~0_1| |v_thr2Thread1of1ForFork1_#t~nondet9#1_3|) InVars {thr2Thread1of1ForFork1_#t~nondet9#1=|v_thr2Thread1of1ForFork1_#t~nondet9#1_3|} OutVars{#race~b2~0=|v_#race~b2~0_1|, thr2Thread1of1ForFork1_#t~nondet9#1=|v_thr2Thread1of1ForFork1_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~b2~0][41], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 225#true, 41#L689-1true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, 17#L705-2true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,274 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,274 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,274 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,274 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,274 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,279 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([672] L680-2-->L680-3: Formula: (= |v_#race~x~0_7| |v_thr1Thread1of1ForFork0_#t~nondet2#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~x~0][91], [Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 57#L713-2true, 211#true, Black: 240#true, 255#true, 165#L732-4true, 250#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 45#L680-3true, Black: 252#(= |#race~x~0| 0), Black: 220#true]) [2025-01-09 21:03:48,279 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:03:48,279 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,279 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,279 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:03:48,279 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L680-2-->L680-3: Formula: (= |v_#race~x~0_7| |v_thr1Thread1of1ForFork0_#t~nondet2#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, thr1Thread1of1ForFork0_#t~nondet2#1=|v_thr1Thread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~x~0][91], [Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 117#L713-1true, Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, 250#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 45#L680-3true, Black: 252#(= |#race~x~0| 0), Black: 220#true]) [2025-01-09 21:03:48,279 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-01-09 21:03:48,279 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:03:48,279 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:03:48,279 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:03:48,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][127], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 162#L706-3true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, Black: 235#true, 211#true, Black: 240#true, 255#true, 250#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), 19#L687-1true, Black: 252#(= |#race~x~0| 0)]) [2025-01-09 21:03:48,282 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-01-09 21:03:48,282 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:03:48,282 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:03:48,282 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:03:48,292 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([576] L706-2-->L706-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet10#1_3| |v_#race~x~0_1|) InVars {thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_1|, thr2Thread1of1ForFork1_#t~nondet10#1=|v_thr2Thread1of1ForFork1_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][127], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), 162#L706-3true, Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, 47#L687-2true, Black: 230#true, Black: 235#true, 211#true, Black: 240#true, 255#true, 250#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 252#(= |#race~x~0| 0)]) [2025-01-09 21:03:48,292 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:03:48,292 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,292 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:03:48,293 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,293 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:03:48,296 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([578] L724-5-->L725: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][233], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 194#L691-5true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 48#L725true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true]) [2025-01-09 21:03:48,296 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,296 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,296 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,296 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,296 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:03:48,296 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,298 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([674] L698-5-->L699: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][231], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 137#L717-5true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 165#L732-4true, Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true, 196#L699true]) [2025-01-09 21:03:48,298 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,298 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,298 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,298 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,298 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-01-09 21:03:48,298 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:03:48,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([649] L717-2-->L717-5: Formula: (= v_~y~0_9 0) InVars {~y~0=v_~y~0_9} OutVars{~y~0=v_~y~0_9} AuxVars[] AssignedVars[][267], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 137#L717-5true, 213#true, Black: 230#true, 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true, 196#L699true]) [2025-01-09 21:03:48,408 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-01-09 21:03:48,408 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:03:48,408 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,408 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:03:48,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([683] L699-1-->L699-2: Formula: (= |v_#race~y~0_19| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_19|, thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][210], [Black: 222#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet2#1|), Black: 227#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~b2~0|), 145#L717-2true, 213#true, Black: 232#(= |#race~y~0| 0), 252#(= |#race~x~0| 0), Black: 237#(= |thr2Thread1of1ForFork1_#t~nondet10#1| |#race~x~0|), 211#true, Black: 240#true, 255#true, 165#L732-4true, Black: 247#(= |#race~y~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 217#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet1#1|), Black: 250#true, 178#L699-2true]) [2025-01-09 21:03:48,410 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-01-09 21:03:48,410 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:03:48,410 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:03:48,410 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:03:48,413 INFO L124 PetriNetUnfolderBase]: 1357/8284 cut-off events. [2025-01-09 21:03:48,413 INFO L125 PetriNetUnfolderBase]: For 2903/3264 co-relation queries the response was YES. [2025-01-09 21:03:48,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14121 conditions, 8284 events. 1357/8284 cut-off events. For 2903/3264 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 99380 event pairs, 198 based on Foata normal form. 20/6875 useless extension candidates. Maximal degree in co-relation 14109. Up to 1105 conditions per place. [2025-01-09 21:03:48,452 INFO L140 encePairwiseOnDemand]: 217/227 looper letters, 39 selfloop transitions, 17 changer transitions 0/285 dead transitions. [2025-01-09 21:03:48,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 285 transitions, 1103 flow [2025-01-09 21:03:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-01-09 21:03:48,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9016152716593245 [2025-01-09 21:03:48,454 INFO L175 Difference]: Start difference. First operand has 217 places, 271 transitions, 936 flow. Second operand 3 states and 614 transitions. [2025-01-09 21:03:48,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 285 transitions, 1103 flow [2025-01-09 21:03:48,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 285 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:48,463 INFO L231 Difference]: Finished difference. Result has 219 places, 284 transitions, 1064 flow [2025-01-09 21:03:48,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=219, PETRI_TRANSITIONS=284} [2025-01-09 21:03:48,464 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 16 predicate places. [2025-01-09 21:03:48,464 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 284 transitions, 1064 flow [2025-01-09 21:03:48,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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:03:48,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:48,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] [2025-01-09 21:03:48,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:03:48,465 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:03:48,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:48,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1103050933, now seen corresponding path program 1 times [2025-01-09 21:03:48,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:48,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344468888] [2025-01-09 21:03:48,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:48,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:48,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:03:48,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:03:48,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:48,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:03:48,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:03:48,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:03:48,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:03:48,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:48,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:03:48,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:03:48,523 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:03:48,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (61 of 62 remaining) [2025-01-09 21:03:48,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err11ASSERT_VIOLATIONDATA_RACE (60 of 62 remaining) [2025-01-09 21:03:48,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (59 of 62 remaining) [2025-01-09 21:03:48,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err12ASSERT_VIOLATIONDATA_RACE (58 of 62 remaining) [2025-01-09 21:03:48,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (57 of 62 remaining) [2025-01-09 21:03:48,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err13ASSERT_VIOLATIONDATA_RACE (56 of 62 remaining) [2025-01-09 21:03:48,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (55 of 62 remaining) [2025-01-09 21:03:48,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err14ASSERT_VIOLATIONDATA_RACE (54 of 62 remaining) [2025-01-09 21:03:48,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (53 of 62 remaining) [2025-01-09 21:03:48,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (52 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (51 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (50 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (49 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (48 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (47 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err10ASSERT_VIOLATIONDATA_RACE (46 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (45 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (44 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (43 of 62 remaining) [2025-01-09 21:03:48,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (42 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (41 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (40 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (39 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (38 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (37 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (36 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (35 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (34 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (33 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (32 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (31 of 62 remaining) [2025-01-09 21:03:48,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err11ASSERT_VIOLATIONDATA_RACE (28 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (27 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err12ASSERT_VIOLATIONDATA_RACE (26 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (25 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err13ASSERT_VIOLATIONDATA_RACE (24 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (23 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err14ASSERT_VIOLATIONDATA_RACE (22 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (21 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (20 of 62 remaining) [2025-01-09 21:03:48,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (19 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (18 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (17 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (16 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (15 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err10ASSERT_VIOLATIONDATA_RACE (14 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (13 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (11 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (10 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 62 remaining) [2025-01-09 21:03:48,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (8 of 62 remaining) [2025-01-09 21:03:48,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 62 remaining) [2025-01-09 21:03:48,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (6 of 62 remaining) [2025-01-09 21:03:48,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 62 remaining) [2025-01-09 21:03:48,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 62 remaining) [2025-01-09 21:03:48,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (3 of 62 remaining) [2025-01-09 21:03:48,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 62 remaining) [2025-01-09 21:03:48,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 62 remaining) [2025-01-09 21:03:48,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (0 of 62 remaining) [2025-01-09 21:03:48,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:03:48,536 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:48,582 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:03:48,582 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:03:48,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:03:48 BasicIcfg [2025-01-09 21:03:48,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:03:48,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:03:48,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:03:48,588 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:03:48,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:42" (3/4) ... [2025-01-09 21:03:48,591 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:03:48,646 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-01-09 21:03:48,681 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:03:48,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:03:48,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:03:48,682 INFO L158 Benchmark]: Toolchain (without parser) took 7050.14ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.4MB in the beginning and 149.7MB in the end (delta: -37.3MB). Peak memory consumption was 220.0MB. Max. memory is 16.1GB. [2025-01-09 21:03:48,683 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:03:48,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.57ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 92.6MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:03:48,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.65ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:03:48,683 INFO L158 Benchmark]: Boogie Preprocessor took 35.18ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:03:48,684 INFO L158 Benchmark]: RCFGBuilder took 532.27ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 71.4MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:03:48,684 INFO L158 Benchmark]: TraceAbstraction took 5969.50ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 70.9MB in the beginning and 158.1MB in the end (delta: -87.2MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. [2025-01-09 21:03:48,685 INFO L158 Benchmark]: Witness Printer took 93.57ms. Allocated memory is still 402.7MB. Free memory was 158.1MB in the beginning and 149.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:03:48,686 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.57ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 92.6MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.65ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.18ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 532.27ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 71.4MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5969.50ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 70.9MB in the beginning and 158.1MB in the end (delta: -87.2MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. * Witness Printer took 93.57ms. Allocated memory is still 402.7MB. Free memory was 158.1MB in the beginning and 149.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 680]: Data race detected Data race detected The following path leads to a data race: [L674] 0 int x, y; VAL [x=0, y=0] [L675] 0 int b1, b2; VAL [b1=0, b2=0, x=0, y=0] [L676] 0 int X; VAL [X=0, b1=0, b2=0, x=0, y=0] [L730] 0 pthread_t t1, t2; VAL [X=0, b1=0, b2=0, x=0, y=0] [L731] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [X=0, b1=0, b2=0, t1=-1, x=0, y=0] [L679] 1 b1 = 1 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=0, x=0, y=0] [L680] 1 x = 1 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=0, x=1, y=0] [L732] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [X=0, b1=1, b2=0, t1=-1, t2=0, x=1, y=0] [L705] 2 b2 = 1 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=1, x=1, y=0] [L706] 2 x = 2 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=1, x=2, y=0] [L680] 1 x = 1 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=1, x=2, y=0] Now there is a data race on ~x~0 between C: x = 2 [706] and C: x = 1 [680] - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 679]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 683]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 376 locations, 62 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 384 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 129 mSDtfsCounter, 384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064occurred in iteration=10, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 399 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:03:48,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)