./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:52:58,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:52:58,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:52:58,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:52:58,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:52:58,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:52:58,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:52:58,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:52:58,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:52:58,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:52:58,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:52:58,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:52:58,535 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:52:58,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:52:58,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:52:58,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:52:58,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:52:58,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:52:58,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:52:58,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:52:58,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:52:58,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:58,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:52:58,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-03-04 06:52:58,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:52:58,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:52:58,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:52:58,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:52:58,818 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:52:58,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-04 06:53:00,058 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc29cf18/2d34950c7f1c46d9a1e306a0fbc27ba6/FLAG01be6b230 [2025-03-04 06:53:00,314 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:53:00,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-04 06:53:00,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc29cf18/2d34950c7f1c46d9a1e306a0fbc27ba6/FLAG01be6b230 [2025-03-04 06:53:00,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc29cf18/2d34950c7f1c46d9a1e306a0fbc27ba6 [2025-03-04 06:53:00,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:53:00,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:53:00,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:53:00,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:53:00,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:53:00,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4043edbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00, skipping insertion in model container [2025-03-04 06:53:00,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:53:00,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:53:00,550 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:53:00,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:53:00,609 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:53:00,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00 WrapperNode [2025-03-04 06:53:00,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:53:00,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:53:00,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:53:00,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:53:00,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,662 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 529 [2025-03-04 06:53:00,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:53:00,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:53:00,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:53:00,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:53:00,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:53:00,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:53:00,718 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:53:00,718 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:53:00,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:53:00,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:53:00,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:53:00,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:53:00,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:53:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:53:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:53:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:53:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:53:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:53:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:53:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:53:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:53:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:53:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:53:00,795 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:53:00,922 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:53:00,924 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:53:01,629 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:53:01,630 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:53:01,656 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:53:01,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:53:01,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:53:01 BoogieIcfgContainer [2025-03-04 06:53:01,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:53:01,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:53:01,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:53:01,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:53:01,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:53:00" (1/3) ... [2025-03-04 06:53:01,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1b222d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:53:01, skipping insertion in model container [2025-03-04 06:53:01,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (2/3) ... [2025-03-04 06:53:01,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1b222d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:53:01, skipping insertion in model container [2025-03-04 06:53:01,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:53:01" (3/3) ... [2025-03-04 06:53:01,666 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-03-04 06:53:01,678 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:53:01,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 685 locations, 1 initial locations, 4 loop locations, and 78 error locations. [2025-03-04 06:53:01,679 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:53:01,829 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:53:01,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 691 places, 713 transitions, 1440 flow [2025-03-04 06:53:02,042 INFO L124 PetriNetUnfolderBase]: 29/711 cut-off events. [2025-03-04 06:53:02,045 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:53:02,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 711 events. 29/711 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1172 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 517. Up to 2 conditions per place. [2025-03-04 06:53:02,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 691 places, 713 transitions, 1440 flow [2025-03-04 06:53:02,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 669 places, 689 transitions, 1390 flow [2025-03-04 06:53:02,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:53:02,089 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;@1eb471fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:53:02,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2025-03-04 06:53:02,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:53:02,094 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-03-04 06:53:02,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:53:02,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:02,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:02,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:02,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2102327437, now seen corresponding path program 1 times [2025-03-04 06:53:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:02,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368848587] [2025-03-04 06:53:02,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:02,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:02,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:53:02,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:53:02,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:02,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:02,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:02,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368848587] [2025-03-04 06:53:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368848587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740095403] [2025-03-04 06:53:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:02,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:02,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:02,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:02,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:02,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 713 [2025-03-04 06:53:02,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 689 transitions, 1390 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:02,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:02,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 713 [2025-03-04 06:53:02,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:02,576 INFO L124 PetriNetUnfolderBase]: 39/1279 cut-off events. [2025-03-04 06:53:02,577 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 06:53:02,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1279 events. 39/1279 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5191 event pairs, 15 based on Foata normal form. 29/1085 useless extension candidates. Maximal degree in co-relation 949. Up to 48 conditions per place. [2025-03-04 06:53:02,584 INFO L140 encePairwiseOnDemand]: 695/713 looper letters, 17 selfloop transitions, 2 changer transitions 11/673 dead transitions. [2025-03-04 06:53:02,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 673 transitions, 1396 flow [2025-03-04 06:53:02,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2060 transitions. [2025-03-04 06:53:02,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630668536699393 [2025-03-04 06:53:02,601 INFO L175 Difference]: Start difference. First operand has 669 places, 689 transitions, 1390 flow. Second operand 3 states and 2060 transitions. [2025-03-04 06:53:02,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 673 transitions, 1396 flow [2025-03-04 06:53:02,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 673 transitions, 1388 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:53:02,620 INFO L231 Difference]: Finished difference. Result has 666 places, 662 transitions, 1332 flow [2025-03-04 06:53:02,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1332, PETRI_PLACES=666, PETRI_TRANSITIONS=662} [2025-03-04 06:53:02,626 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -3 predicate places. [2025-03-04 06:53:02,626 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 662 transitions, 1332 flow [2025-03-04 06:53:02,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:02,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:02,627 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] [2025-03-04 06:53:02,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:53:02,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:02,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash 762516882, now seen corresponding path program 1 times [2025-03-04 06:53:02,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:02,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558463272] [2025-03-04 06:53:02,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:02,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:02,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:53:02,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:53:02,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:02,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558463272] [2025-03-04 06:53:02,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558463272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:02,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:02,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001057356] [2025-03-04 06:53:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:02,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:02,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:02,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:02,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 713 [2025-03-04 06:53:02,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 662 transitions, 1332 flow. Second operand has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:02,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:02,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 713 [2025-03-04 06:53:02,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:03,043 INFO L124 PetriNetUnfolderBase]: 97/2038 cut-off events. [2025-03-04 06:53:03,043 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-04 06:53:03,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 2038 events. 97/2038 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11793 event pairs, 48 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 2141. Up to 125 conditions per place. [2025-03-04 06:53:03,057 INFO L140 encePairwiseOnDemand]: 702/713 looper letters, 24 selfloop transitions, 1 changer transitions 0/652 dead transitions. [2025-03-04 06:53:03,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 652 transitions, 1362 flow [2025-03-04 06:53:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2025-03-04 06:53:03,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434315100514259 [2025-03-04 06:53:03,064 INFO L175 Difference]: Start difference. First operand has 666 places, 662 transitions, 1332 flow. Second operand 3 states and 2018 transitions. [2025-03-04 06:53:03,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 652 transitions, 1362 flow [2025-03-04 06:53:03,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 652 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:03,097 INFO L231 Difference]: Finished difference. Result has 645 places, 652 transitions, 1310 flow [2025-03-04 06:53:03,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=645, PETRI_TRANSITIONS=652} [2025-03-04 06:53:03,098 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -24 predicate places. [2025-03-04 06:53:03,098 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 652 transitions, 1310 flow [2025-03-04 06:53:03,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:03,099 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-03-04 06:53:03,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:53:03,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:03,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash -413293298, now seen corresponding path program 1 times [2025-03-04 06:53:03,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:03,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652371792] [2025-03-04 06:53:03,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:03,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:53:03,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:53:03,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:03,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:03,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-03-04 06:53:03,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:03,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652371792] [2025-03-04 06:53:03,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652371792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:03,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:03,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:03,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343284798] [2025-03-04 06:53:03,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:03,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:03,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:03,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:03,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:03,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 713 [2025-03-04 06:53:03,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 652 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:03,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 713 [2025-03-04 06:53:03,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:03,401 INFO L124 PetriNetUnfolderBase]: 39/1263 cut-off events. [2025-03-04 06:53:03,401 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:53:03,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1263 events. 39/1263 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4930 event pairs, 15 based on Foata normal form. 0/1067 useless extension candidates. Maximal degree in co-relation 1285. Up to 48 conditions per place. [2025-03-04 06:53:03,412 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 17 selfloop transitions, 2 changer transitions 0/651 dead transitions. [2025-03-04 06:53:03,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 651 transitions, 1346 flow [2025-03-04 06:53:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2045 transitions. [2025-03-04 06:53:03,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560542309490416 [2025-03-04 06:53:03,418 INFO L175 Difference]: Start difference. First operand has 645 places, 652 transitions, 1310 flow. Second operand 3 states and 2045 transitions. [2025-03-04 06:53:03,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 651 transitions, 1346 flow [2025-03-04 06:53:03,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 651 transitions, 1345 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:03,430 INFO L231 Difference]: Finished difference. Result has 645 places, 651 transitions, 1311 flow [2025-03-04 06:53:03,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=645, PETRI_TRANSITIONS=651} [2025-03-04 06:53:03,432 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -24 predicate places. [2025-03-04 06:53:03,432 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 651 transitions, 1311 flow [2025-03-04 06:53:03,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:03,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:03,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:53:03,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:03,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 151208566, now seen corresponding path program 1 times [2025-03-04 06:53:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036528913] [2025-03-04 06:53:03,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:03,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 06:53:03,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 06:53:03,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:03,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:03,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:03,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036528913] [2025-03-04 06:53:03,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036528913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:03,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:03,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:03,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428333592] [2025-03-04 06:53:03,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:03,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:03,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:03,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:03,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:03,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 713 [2025-03-04 06:53:03,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 651 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:03,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 713 [2025-03-04 06:53:03,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:03,813 INFO L124 PetriNetUnfolderBase]: 98/2027 cut-off events. [2025-03-04 06:53:03,813 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 06:53:03,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 2027 events. 98/2027 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 11522 event pairs, 48 based on Foata normal form. 0/1726 useless extension candidates. Maximal degree in co-relation 2134. Up to 127 conditions per place. [2025-03-04 06:53:03,822 INFO L140 encePairwiseOnDemand]: 702/713 looper letters, 24 selfloop transitions, 1 changer transitions 0/641 dead transitions. [2025-03-04 06:53:03,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 641 transitions, 1341 flow [2025-03-04 06:53:03,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2025-03-04 06:53:03,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434315100514259 [2025-03-04 06:53:03,826 INFO L175 Difference]: Start difference. First operand has 645 places, 651 transitions, 1311 flow. Second operand 3 states and 2018 transitions. [2025-03-04 06:53:03,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 641 transitions, 1341 flow [2025-03-04 06:53:03,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 641 transitions, 1337 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:03,836 INFO L231 Difference]: Finished difference. Result has 635 places, 641 transitions, 1289 flow [2025-03-04 06:53:03,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=635, PETRI_TRANSITIONS=641} [2025-03-04 06:53:03,838 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-03-04 06:53:03,838 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 641 transitions, 1289 flow [2025-03-04 06:53:03,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:03,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:53:03,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1646356369, now seen corresponding path program 1 times [2025-03-04 06:53:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:03,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738963780] [2025-03-04 06:53:03,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:03,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:53:03,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:53:03,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:03,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:03,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738963780] [2025-03-04 06:53:03,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738963780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:03,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:03,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:03,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720140595] [2025-03-04 06:53:03,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:03,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:03,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:03,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:03,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-03-04 06:53:03,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 641 transitions, 1289 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:03,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-03-04 06:53:03,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:03,976 INFO L124 PetriNetUnfolderBase]: 16/789 cut-off events. [2025-03-04 06:53:03,977 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-04 06:53:03,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 789 events. 16/789 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1412 event pairs, 1 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 775. Up to 13 conditions per place. [2025-03-04 06:53:03,983 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/640 dead transitions. [2025-03-04 06:53:03,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 640 transitions, 1311 flow [2025-03-04 06:53:03,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-03-04 06:53:03,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-03-04 06:53:03,987 INFO L175 Difference]: Start difference. First operand has 635 places, 641 transitions, 1289 flow. Second operand 3 states and 2059 transitions. [2025-03-04 06:53:03,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 640 transitions, 1311 flow [2025-03-04 06:53:03,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 640 transitions, 1310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:03,994 INFO L231 Difference]: Finished difference. Result has 635 places, 640 transitions, 1290 flow [2025-03-04 06:53:03,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=635, PETRI_TRANSITIONS=640} [2025-03-04 06:53:03,995 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-03-04 06:53:03,995 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 640 transitions, 1290 flow [2025-03-04 06:53:03,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:03,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:03,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:53:03,997 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:03,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:03,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1454236441, now seen corresponding path program 1 times [2025-03-04 06:53:03,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:03,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32734074] [2025-03-04 06:53:03,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:03,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:04,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:53:04,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:53:04,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:04,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32734074] [2025-03-04 06:53:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32734074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:04,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:04,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315627321] [2025-03-04 06:53:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:04,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:04,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:04,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:04,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-03-04 06:53:04,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 640 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:04,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-03-04 06:53:04,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:04,164 INFO L124 PetriNetUnfolderBase]: 24/1086 cut-off events. [2025-03-04 06:53:04,165 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-04 06:53:04,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1086 events. 24/1086 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3400 event pairs, 3 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1080. Up to 17 conditions per place. [2025-03-04 06:53:04,176 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/639 dead transitions. [2025-03-04 06:53:04,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 639 transitions, 1312 flow [2025-03-04 06:53:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-03-04 06:53:04,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-03-04 06:53:04,180 INFO L175 Difference]: Start difference. First operand has 635 places, 640 transitions, 1290 flow. Second operand 3 states and 2059 transitions. [2025-03-04 06:53:04,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 639 transitions, 1312 flow [2025-03-04 06:53:04,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 639 transitions, 1308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:04,187 INFO L231 Difference]: Finished difference. Result has 634 places, 639 transitions, 1288 flow [2025-03-04 06:53:04,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=634, PETRI_TRANSITIONS=639} [2025-03-04 06:53:04,189 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2025-03-04 06:53:04,189 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 639 transitions, 1288 flow [2025-03-04 06:53:04,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:04,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:04,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:53:04,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:04,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1989899633, now seen corresponding path program 1 times [2025-03-04 06:53:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:04,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070204863] [2025-03-04 06:53:04,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:04,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:53:04,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:53:04,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:04,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:04,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070204863] [2025-03-04 06:53:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070204863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:04,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:04,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:04,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716393183] [2025-03-04 06:53:04,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:04,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:04,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:04,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:04,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:04,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-03-04 06:53:04,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 639 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:04,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-03-04 06:53:04,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:04,378 INFO L124 PetriNetUnfolderBase]: 24/1085 cut-off events. [2025-03-04 06:53:04,378 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-04 06:53:04,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 1085 events. 24/1085 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3358 event pairs, 3 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1079. Up to 17 conditions per place. [2025-03-04 06:53:04,386 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/638 dead transitions. [2025-03-04 06:53:04,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 638 transitions, 1310 flow [2025-03-04 06:53:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-03-04 06:53:04,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-03-04 06:53:04,389 INFO L175 Difference]: Start difference. First operand has 634 places, 639 transitions, 1288 flow. Second operand 3 states and 2059 transitions. [2025-03-04 06:53:04,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 638 transitions, 1310 flow [2025-03-04 06:53:04,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 638 transitions, 1306 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:04,396 INFO L231 Difference]: Finished difference. Result has 633 places, 638 transitions, 1286 flow [2025-03-04 06:53:04,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1286, PETRI_PLACES=633, PETRI_TRANSITIONS=638} [2025-03-04 06:53:04,397 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -36 predicate places. [2025-03-04 06:53:04,398 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 638 transitions, 1286 flow [2025-03-04 06:53:04,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:04,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:04,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:53:04,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:04,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash -313906810, now seen corresponding path program 1 times [2025-03-04 06:53:04,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:04,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612848896] [2025-03-04 06:53:04,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:04,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:53:04,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:53:04,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:04,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:04,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612848896] [2025-03-04 06:53:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612848896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:04,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012007307] [2025-03-04 06:53:04,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:04,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:04,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:04,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:04,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:04,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-03-04 06:53:04,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 638 transitions, 1286 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:04,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-03-04 06:53:04,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:04,531 INFO L124 PetriNetUnfolderBase]: 13/652 cut-off events. [2025-03-04 06:53:04,531 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:53:04,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 652 events. 13/652 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1050 event pairs, 1 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 639. Up to 13 conditions per place. [2025-03-04 06:53:04,536 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/637 dead transitions. [2025-03-04 06:53:04,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 637 transitions, 1308 flow [2025-03-04 06:53:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-03-04 06:53:04,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-03-04 06:53:04,540 INFO L175 Difference]: Start difference. First operand has 633 places, 638 transitions, 1286 flow. Second operand 3 states and 2059 transitions. [2025-03-04 06:53:04,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 637 transitions, 1308 flow [2025-03-04 06:53:04,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 637 transitions, 1304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:04,546 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1284 flow [2025-03-04 06:53:04,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=632, PETRI_TRANSITIONS=637} [2025-03-04 06:53:04,548 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -37 predicate places. [2025-03-04 06:53:04,548 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1284 flow [2025-03-04 06:53:04,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:04,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:04,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:53:04,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:04,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1547876658, now seen corresponding path program 1 times [2025-03-04 06:53:04,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:04,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952663749] [2025-03-04 06:53:04,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:04,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:04,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 06:53:04,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 06:53:04,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:04,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952663749] [2025-03-04 06:53:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952663749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:04,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286549725] [2025-03-04 06:53:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:04,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:04,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:04,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:04,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-03-04 06:53:04,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 637 transitions, 1284 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:04,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-03-04 06:53:04,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:04,713 INFO L124 PetriNetUnfolderBase]: 18/769 cut-off events. [2025-03-04 06:53:04,713 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:53:04,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 769 events. 18/769 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1451 event pairs, 3 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 760. Up to 17 conditions per place. [2025-03-04 06:53:04,719 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2025-03-04 06:53:04,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 636 transitions, 1306 flow [2025-03-04 06:53:04,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-03-04 06:53:04,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-03-04 06:53:04,722 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1284 flow. Second operand 3 states and 2059 transitions. [2025-03-04 06:53:04,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 636 transitions, 1306 flow [2025-03-04 06:53:04,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 636 transitions, 1302 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:04,728 INFO L231 Difference]: Finished difference. Result has 631 places, 636 transitions, 1282 flow [2025-03-04 06:53:04,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1282, PETRI_PLACES=631, PETRI_TRANSITIONS=636} [2025-03-04 06:53:04,730 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -38 predicate places. [2025-03-04 06:53:04,730 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 636 transitions, 1282 flow [2025-03-04 06:53:04,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:04,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:04,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:53:04,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:04,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash -938647254, now seen corresponding path program 1 times [2025-03-04 06:53:04,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:04,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844277591] [2025-03-04 06:53:04,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:04,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:53:04,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:53:04,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:04,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844277591] [2025-03-04 06:53:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844277591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:04,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:04,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352046039] [2025-03-04 06:53:04,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:04,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:04,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:04,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:04,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-03-04 06:53:04,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 636 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:04,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-03-04 06:53:04,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:04,867 INFO L124 PetriNetUnfolderBase]: 18/749 cut-off events. [2025-03-04 06:53:04,868 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:53:04,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 749 events. 18/749 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1411 event pairs, 3 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 740. Up to 17 conditions per place. [2025-03-04 06:53:04,873 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2025-03-04 06:53:04,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 635 transitions, 1304 flow [2025-03-04 06:53:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-03-04 06:53:04,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-03-04 06:53:04,876 INFO L175 Difference]: Start difference. First operand has 631 places, 636 transitions, 1282 flow. Second operand 3 states and 2059 transitions. [2025-03-04 06:53:04,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 635 transitions, 1304 flow [2025-03-04 06:53:04,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 635 transitions, 1300 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:04,883 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1280 flow [2025-03-04 06:53:04,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1280, PETRI_PLACES=630, PETRI_TRANSITIONS=635} [2025-03-04 06:53:04,886 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -39 predicate places. [2025-03-04 06:53:04,886 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1280 flow [2025-03-04 06:53:04,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:04,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:04,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:53:04,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:04,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash -424614891, now seen corresponding path program 1 times [2025-03-04 06:53:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697517943] [2025-03-04 06:53:04,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:04,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 06:53:04,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 06:53:04,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:04,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:04,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:04,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697517943] [2025-03-04 06:53:04,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697517943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:04,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:04,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:04,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490990419] [2025-03-04 06:53:04,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:04,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:04,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:04,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:04,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:04,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 681 out of 713 [2025-03-04 06:53:04,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 635 transitions, 1280 flow. Second operand has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:04,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 681 of 713 [2025-03-04 06:53:04,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:05,082 INFO L124 PetriNetUnfolderBase]: 29/1076 cut-off events. [2025-03-04 06:53:05,083 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:53:05,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1076 events. 29/1076 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3711 event pairs, 8 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1080. Up to 28 conditions per place. [2025-03-04 06:53:05,090 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 11 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2025-03-04 06:53:05,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 634 transitions, 1304 flow [2025-03-04 06:53:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2025-03-04 06:53:05,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616643291257597 [2025-03-04 06:53:05,095 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1280 flow. Second operand 3 states and 2057 transitions. [2025-03-04 06:53:05,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 634 transitions, 1304 flow [2025-03-04 06:53:05,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 634 transitions, 1300 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:05,102 INFO L231 Difference]: Finished difference. Result has 629 places, 634 transitions, 1278 flow [2025-03-04 06:53:05,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1278, PETRI_PLACES=629, PETRI_TRANSITIONS=634} [2025-03-04 06:53:05,103 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -40 predicate places. [2025-03-04 06:53:05,104 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 634 transitions, 1278 flow [2025-03-04 06:53:05,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:05,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:05,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:05,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:53:05,105 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:05,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2004817554, now seen corresponding path program 1 times [2025-03-04 06:53:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:05,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817338628] [2025-03-04 06:53:05,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:05,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 06:53:05,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 06:53:05,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:05,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:05,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:05,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817338628] [2025-03-04 06:53:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817338628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:05,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:05,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:53:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081416961] [2025-03-04 06:53:05,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:05,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:53:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:05,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:53:05,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:53:05,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 713 [2025-03-04 06:53:05,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 634 transitions, 1278 flow. Second operand has 6 states, 6 states have (on average 627.5) internal successors, (3765), 6 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:05,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:05,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 713 [2025-03-04 06:53:05,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:06,311 INFO L124 PetriNetUnfolderBase]: 439/4180 cut-off events. [2025-03-04 06:53:06,311 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 06:53:06,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 4180 events. 439/4180 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 32715 event pairs, 360 based on Foata normal form. 0/3603 useless extension candidates. Maximal degree in co-relation 4973. Up to 792 conditions per place. [2025-03-04 06:53:06,332 INFO L140 encePairwiseOnDemand]: 701/713 looper letters, 58 selfloop transitions, 10 changer transitions 0/632 dead transitions. [2025-03-04 06:53:06,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 632 transitions, 1410 flow [2025-03-04 06:53:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:53:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:53:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3826 transitions. [2025-03-04 06:53:06,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8943431510051426 [2025-03-04 06:53:06,339 INFO L175 Difference]: Start difference. First operand has 629 places, 634 transitions, 1278 flow. Second operand 6 states and 3826 transitions. [2025-03-04 06:53:06,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 632 transitions, 1410 flow [2025-03-04 06:53:06,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 632 transitions, 1406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:06,346 INFO L231 Difference]: Finished difference. Result has 630 places, 632 transitions, 1290 flow [2025-03-04 06:53:06,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1290, PETRI_PLACES=630, PETRI_TRANSITIONS=632} [2025-03-04 06:53:06,348 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -39 predicate places. [2025-03-04 06:53:06,349 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 632 transitions, 1290 flow [2025-03-04 06:53:06,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 627.5) internal successors, (3765), 6 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:06,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:06,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:06,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:53:06,351 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:06,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash 250330246, now seen corresponding path program 1 times [2025-03-04 06:53:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:06,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759682145] [2025-03-04 06:53:06,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:06,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 06:53:06,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 06:53:06,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:06,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:06,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:06,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759682145] [2025-03-04 06:53:06,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759682145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:06,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:06,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:06,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214279678] [2025-03-04 06:53:06,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:06,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:06,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:06,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:06,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:06,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 681 out of 713 [2025-03-04 06:53:06,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 632 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:06,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:06,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 681 of 713 [2025-03-04 06:53:06,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:06,570 INFO L124 PetriNetUnfolderBase]: 29/1079 cut-off events. [2025-03-04 06:53:06,571 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-04 06:53:06,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 1079 events. 29/1079 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3395 event pairs, 8 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1094. Up to 28 conditions per place. [2025-03-04 06:53:06,581 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 11 selfloop transitions, 2 changer transitions 0/631 dead transitions. [2025-03-04 06:53:06,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 631 transitions, 1314 flow [2025-03-04 06:53:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2025-03-04 06:53:06,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616643291257597 [2025-03-04 06:53:06,585 INFO L175 Difference]: Start difference. First operand has 630 places, 632 transitions, 1290 flow. Second operand 3 states and 2057 transitions. [2025-03-04 06:53:06,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 631 transitions, 1314 flow [2025-03-04 06:53:06,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 631 transitions, 1294 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:53:06,595 INFO L231 Difference]: Finished difference. Result has 626 places, 631 transitions, 1272 flow [2025-03-04 06:53:06,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=626, PETRI_TRANSITIONS=631} [2025-03-04 06:53:06,598 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -43 predicate places. [2025-03-04 06:53:06,598 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 631 transitions, 1272 flow [2025-03-04 06:53:06,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:06,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:06,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:06,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:53:06,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1674080543, now seen corresponding path program 1 times [2025-03-04 06:53:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:06,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602668578] [2025-03-04 06:53:06,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:06,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-04 06:53:06,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 06:53:06,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:06,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602668578] [2025-03-04 06:53:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602668578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:06,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86266909] [2025-03-04 06:53:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:06,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:06,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:06,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:06,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 713 [2025-03-04 06:53:06,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 631 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:06,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:06,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 713 [2025-03-04 06:53:06,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:07,479 INFO L124 PetriNetUnfolderBase]: 439/4177 cut-off events. [2025-03-04 06:53:07,479 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 06:53:07,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5005 conditions, 4177 events. 439/4177 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 32711 event pairs, 360 based on Foata normal form. 0/3603 useless extension candidates. Maximal degree in co-relation 4970. Up to 798 conditions per place. [2025-03-04 06:53:07,494 INFO L140 encePairwiseOnDemand]: 707/713 looper letters, 64 selfloop transitions, 4 changer transitions 0/629 dead transitions. [2025-03-04 06:53:07,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 629 transitions, 1404 flow [2025-03-04 06:53:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1948 transitions. [2025-03-04 06:53:07,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9107059373539037 [2025-03-04 06:53:07,497 INFO L175 Difference]: Start difference. First operand has 626 places, 631 transitions, 1272 flow. Second operand 3 states and 1948 transitions. [2025-03-04 06:53:07,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 629 transitions, 1404 flow [2025-03-04 06:53:07,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 629 transitions, 1400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:07,503 INFO L231 Difference]: Finished difference. Result has 624 places, 629 transitions, 1272 flow [2025-03-04 06:53:07,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=624, PETRI_TRANSITIONS=629} [2025-03-04 06:53:07,504 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -45 predicate places. [2025-03-04 06:53:07,505 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 629 transitions, 1272 flow [2025-03-04 06:53:07,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:07,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:53:07,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:07,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1105731929, now seen corresponding path program 1 times [2025-03-04 06:53:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:07,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998371550] [2025-03-04 06:53:07,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:07,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-04 06:53:07,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 06:53:07,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:07,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:07,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998371550] [2025-03-04 06:53:07,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998371550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:07,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:07,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526756200] [2025-03-04 06:53:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:07,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:07,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:07,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:07,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 683 out of 713 [2025-03-04 06:53:07,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 629 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:07,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 683 of 713 [2025-03-04 06:53:07,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:07,651 INFO L124 PetriNetUnfolderBase]: 18/780 cut-off events. [2025-03-04 06:53:07,651 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-04 06:53:07,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 780 events. 18/780 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1759 event pairs, 3 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 788. Up to 16 conditions per place. [2025-03-04 06:53:07,657 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 9 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2025-03-04 06:53:07,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 628 transitions, 1292 flow [2025-03-04 06:53:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2061 transitions. [2025-03-04 06:53:07,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635343618513323 [2025-03-04 06:53:07,660 INFO L175 Difference]: Start difference. First operand has 624 places, 629 transitions, 1272 flow. Second operand 3 states and 2061 transitions. [2025-03-04 06:53:07,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 628 transitions, 1292 flow [2025-03-04 06:53:07,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 628 transitions, 1284 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:07,667 INFO L231 Difference]: Finished difference. Result has 623 places, 628 transitions, 1266 flow [2025-03-04 06:53:07,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=623, PETRI_TRANSITIONS=628} [2025-03-04 06:53:07,669 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -46 predicate places. [2025-03-04 06:53:07,669 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 628 transitions, 1266 flow [2025-03-04 06:53:07,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:07,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:07,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:53:07,670 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:07,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash -819749726, now seen corresponding path program 1 times [2025-03-04 06:53:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058063366] [2025-03-04 06:53:07,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:07,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-04 06:53:07,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-04 06:53:07,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:07,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058063366] [2025-03-04 06:53:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058063366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:07,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608005632] [2025-03-04 06:53:07,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:07,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:07,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:07,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:07,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 683 out of 713 [2025-03-04 06:53:07,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 628 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:07,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 683 of 713 [2025-03-04 06:53:07,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:07,831 INFO L124 PetriNetUnfolderBase]: 21/884 cut-off events. [2025-03-04 06:53:07,831 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:53:07,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 884 events. 21/884 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2031 event pairs, 3 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 875. Up to 16 conditions per place. [2025-03-04 06:53:07,835 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 9 selfloop transitions, 2 changer transitions 0/627 dead transitions. [2025-03-04 06:53:07,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 627 transitions, 1286 flow [2025-03-04 06:53:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2061 transitions. [2025-03-04 06:53:07,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635343618513323 [2025-03-04 06:53:07,838 INFO L175 Difference]: Start difference. First operand has 623 places, 628 transitions, 1266 flow. Second operand 3 states and 2061 transitions. [2025-03-04 06:53:07,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 627 transitions, 1286 flow [2025-03-04 06:53:07,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 627 transitions, 1282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:07,845 INFO L231 Difference]: Finished difference. Result has 622 places, 627 transitions, 1264 flow [2025-03-04 06:53:07,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=622, PETRI_TRANSITIONS=627} [2025-03-04 06:53:07,847 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -47 predicate places. [2025-03-04 06:53:07,847 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 627 transitions, 1264 flow [2025-03-04 06:53:07,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:07,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:07,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:53:07,849 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:07,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash -783920754, now seen corresponding path program 1 times [2025-03-04 06:53:07,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:07,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833608517] [2025-03-04 06:53:07,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:07,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-04 06:53:07,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-04 06:53:07,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:07,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833608517] [2025-03-04 06:53:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833608517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962783098] [2025-03-04 06:53:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:07,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:07,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:07,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:07,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 713 [2025-03-04 06:53:07,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 627 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 680.3333333333334) internal successors, (2041), 3 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:07,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 713 [2025-03-04 06:53:07,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:08,066 INFO L124 PetriNetUnfolderBase]: 57/1622 cut-off events. [2025-03-04 06:53:08,067 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 06:53:08,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 1622 events. 57/1622 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7611 event pairs, 19 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1664. Up to 61 conditions per place. [2025-03-04 06:53:08,077 INFO L140 encePairwiseOnDemand]: 707/713 looper letters, 14 selfloop transitions, 2 changer transitions 0/626 dead transitions. [2025-03-04 06:53:08,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 626 transitions, 1295 flow [2025-03-04 06:53:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2025-03-04 06:53:08,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616643291257597 [2025-03-04 06:53:08,080 INFO L175 Difference]: Start difference. First operand has 622 places, 627 transitions, 1264 flow. Second operand 3 states and 2057 transitions. [2025-03-04 06:53:08,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 626 transitions, 1295 flow [2025-03-04 06:53:08,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 626 transitions, 1291 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:08,089 INFO L231 Difference]: Finished difference. Result has 619 places, 625 transitions, 1266 flow [2025-03-04 06:53:08,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=619, PETRI_TRANSITIONS=625} [2025-03-04 06:53:08,090 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -50 predicate places. [2025-03-04 06:53:08,090 INFO L471 AbstractCegarLoop]: Abstraction has has 619 places, 625 transitions, 1266 flow [2025-03-04 06:53:08,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.3333333333334) internal successors, (2041), 3 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:08,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:08,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:53:08,095 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:08,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash -822448936, now seen corresponding path program 1 times [2025-03-04 06:53:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:08,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976538317] [2025-03-04 06:53:08,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:08,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:08,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-04 06:53:08,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 06:53:08,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:08,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976538317] [2025-03-04 06:53:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976538317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:08,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:08,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445282230] [2025-03-04 06:53:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:08,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:08,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:08,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:08,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 713 [2025-03-04 06:53:08,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 625 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 680.6666666666666) internal successors, (2042), 3 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:08,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 713 [2025-03-04 06:53:08,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:08,346 INFO L124 PetriNetUnfolderBase]: 57/1633 cut-off events. [2025-03-04 06:53:08,347 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2025-03-04 06:53:08,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 1633 events. 57/1633 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7876 event pairs, 15 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1681. Up to 62 conditions per place. [2025-03-04 06:53:08,357 INFO L140 encePairwiseOnDemand]: 707/713 looper letters, 14 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2025-03-04 06:53:08,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 624 transitions, 1297 flow [2025-03-04 06:53:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2025-03-04 06:53:08,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616643291257597 [2025-03-04 06:53:08,360 INFO L175 Difference]: Start difference. First operand has 619 places, 625 transitions, 1266 flow. Second operand 3 states and 2057 transitions. [2025-03-04 06:53:08,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 624 transitions, 1297 flow [2025-03-04 06:53:08,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 624 transitions, 1297 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:08,367 INFO L231 Difference]: Finished difference. Result has 618 places, 623 transitions, 1272 flow [2025-03-04 06:53:08,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=618, PETRI_TRANSITIONS=623} [2025-03-04 06:53:08,368 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -51 predicate places. [2025-03-04 06:53:08,369 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 623 transitions, 1272 flow [2025-03-04 06:53:08,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.6666666666666) internal successors, (2042), 3 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:08,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:08,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:53:08,370 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:08,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 761205106, now seen corresponding path program 1 times [2025-03-04 06:53:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527895348] [2025-03-04 06:53:08,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:08,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-04 06:53:08,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-04 06:53:08,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:08,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:08,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527895348] [2025-03-04 06:53:08,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527895348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:08,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:53:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782234602] [2025-03-04 06:53:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:08,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:53:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:08,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:53:08,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:53:08,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 713 [2025-03-04 06:53:08,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 623 transitions, 1272 flow. Second operand has 7 states, 7 states have (on average 668.2857142857143) internal successors, (4678), 7 states have internal predecessors, (4678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:08,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 713 [2025-03-04 06:53:08,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:09,069 INFO L124 PetriNetUnfolderBase]: 38/1636 cut-off events. [2025-03-04 06:53:09,069 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 06:53:09,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 1636 events. 38/1636 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7779 event pairs, 0 based on Foata normal form. 1/1472 useless extension candidates. Maximal degree in co-relation 1687. Up to 29 conditions per place. [2025-03-04 06:53:09,081 INFO L140 encePairwiseOnDemand]: 703/713 looper letters, 45 selfloop transitions, 9 changer transitions 0/647 dead transitions. [2025-03-04 06:53:09,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 647 transitions, 1432 flow [2025-03-04 06:53:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:53:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 06:53:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4710 transitions. [2025-03-04 06:53:09,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9436986575836506 [2025-03-04 06:53:09,087 INFO L175 Difference]: Start difference. First operand has 618 places, 623 transitions, 1272 flow. Second operand 7 states and 4710 transitions. [2025-03-04 06:53:09,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 647 transitions, 1432 flow [2025-03-04 06:53:09,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 647 transitions, 1432 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:09,094 INFO L231 Difference]: Finished difference. Result has 628 places, 629 transitions, 1329 flow [2025-03-04 06:53:09,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1329, PETRI_PLACES=628, PETRI_TRANSITIONS=629} [2025-03-04 06:53:09,095 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -41 predicate places. [2025-03-04 06:53:09,095 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 629 transitions, 1329 flow [2025-03-04 06:53:09,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 668.2857142857143) internal successors, (4678), 7 states have internal predecessors, (4678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:09,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:09,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:09,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:53:09,097 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:09,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -29207090, now seen corresponding path program 1 times [2025-03-04 06:53:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:09,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304885972] [2025-03-04 06:53:09,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:09,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-04 06:53:09,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-04 06:53:09,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:09,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:09,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:09,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304885972] [2025-03-04 06:53:09,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304885972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:09,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:09,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:53:09,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144236622] [2025-03-04 06:53:09,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:09,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:53:09,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:09,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:53:09,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:53:10,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 713 [2025-03-04 06:53:10,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 629 transitions, 1329 flow. Second operand has 6 states, 6 states have (on average 655.6666666666666) internal successors, (3934), 6 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:10,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:10,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 713 [2025-03-04 06:53:10,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:10,643 INFO L124 PetriNetUnfolderBase]: 350/4930 cut-off events. [2025-03-04 06:53:10,643 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 06:53:10,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5626 conditions, 4930 events. 350/4930 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 40369 event pairs, 140 based on Foata normal form. 0/4370 useless extension candidates. Maximal degree in co-relation 5582. Up to 508 conditions per place. [2025-03-04 06:53:10,669 INFO L140 encePairwiseOnDemand]: 701/713 looper letters, 54 selfloop transitions, 8 changer transitions 0/649 dead transitions. [2025-03-04 06:53:10,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 649 transitions, 1497 flow [2025-03-04 06:53:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:53:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:53:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3990 transitions. [2025-03-04 06:53:10,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326788218793829 [2025-03-04 06:53:10,674 INFO L175 Difference]: Start difference. First operand has 628 places, 629 transitions, 1329 flow. Second operand 6 states and 3990 transitions. [2025-03-04 06:53:10,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 649 transitions, 1497 flow [2025-03-04 06:53:10,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 649 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:10,681 INFO L231 Difference]: Finished difference. Result has 631 places, 633 transitions, 1378 flow [2025-03-04 06:53:10,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1378, PETRI_PLACES=631, PETRI_TRANSITIONS=633} [2025-03-04 06:53:10,682 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -38 predicate places. [2025-03-04 06:53:10,682 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 633 transitions, 1378 flow [2025-03-04 06:53:10,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 655.6666666666666) internal successors, (3934), 6 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:10,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:10,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:10,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:53:10,683 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:10,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash -922846192, now seen corresponding path program 1 times [2025-03-04 06:53:10,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:10,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462926930] [2025-03-04 06:53:10,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-04 06:53:10,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-04 06:53:10,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:10,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462926930] [2025-03-04 06:53:10,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462926930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:10,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579743273] [2025-03-04 06:53:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:10,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:10,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:10,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:10,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:10,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:10,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 633 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:10,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:10,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:10,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:11,045 INFO L124 PetriNetUnfolderBase]: 94/3082 cut-off events. [2025-03-04 06:53:11,045 INFO L125 PetriNetUnfolderBase]: For 21/39 co-relation queries the response was YES. [2025-03-04 06:53:11,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 3082 events. 94/3082 cut-off events. For 21/39 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 22961 event pairs, 8 based on Foata normal form. 2/2734 useless extension candidates. Maximal degree in co-relation 3271. Up to 40 conditions per place. [2025-03-04 06:53:11,057 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/633 dead transitions. [2025-03-04 06:53:11,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 633 transitions, 1403 flow [2025-03-04 06:53:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-03-04 06:53:11,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-03-04 06:53:11,060 INFO L175 Difference]: Start difference. First operand has 631 places, 633 transitions, 1378 flow. Second operand 3 states and 2065 transitions. [2025-03-04 06:53:11,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 633 transitions, 1403 flow [2025-03-04 06:53:11,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 633 transitions, 1403 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:11,068 INFO L231 Difference]: Finished difference. Result has 632 places, 632 transitions, 1380 flow [2025-03-04 06:53:11,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1380, PETRI_PLACES=632, PETRI_TRANSITIONS=632} [2025-03-04 06:53:11,070 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -37 predicate places. [2025-03-04 06:53:11,070 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 632 transitions, 1380 flow [2025-03-04 06:53:11,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:11,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:11,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:11,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:53:11,071 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:11,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1868271976, now seen corresponding path program 1 times [2025-03-04 06:53:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:11,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272608668] [2025-03-04 06:53:11,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:11,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:11,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-04 06:53:11,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-04 06:53:11,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:11,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:11,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:11,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272608668] [2025-03-04 06:53:11,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272608668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:11,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:11,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:53:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926311393] [2025-03-04 06:53:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:11,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:53:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:11,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:53:11,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:53:11,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 713 [2025-03-04 06:53:11,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 632 transitions, 1380 flow. Second operand has 6 states, 6 states have (on average 655.8333333333334) internal successors, (3935), 6 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:11,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:11,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 713 [2025-03-04 06:53:11,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:12,664 INFO L124 PetriNetUnfolderBase]: 368/5642 cut-off events. [2025-03-04 06:53:12,664 INFO L125 PetriNetUnfolderBase]: For 51/77 co-relation queries the response was YES. [2025-03-04 06:53:12,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6468 conditions, 5642 events. 368/5642 cut-off events. For 51/77 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 49398 event pairs, 132 based on Foata normal form. 0/5054 useless extension candidates. Maximal degree in co-relation 6421. Up to 540 conditions per place. [2025-03-04 06:53:12,686 INFO L140 encePairwiseOnDemand]: 701/713 looper letters, 54 selfloop transitions, 8 changer transitions 0/652 dead transitions. [2025-03-04 06:53:12,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 652 transitions, 1548 flow [2025-03-04 06:53:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:53:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:53:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3990 transitions. [2025-03-04 06:53:12,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326788218793829 [2025-03-04 06:53:12,692 INFO L175 Difference]: Start difference. First operand has 632 places, 632 transitions, 1380 flow. Second operand 6 states and 3990 transitions. [2025-03-04 06:53:12,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 652 transitions, 1548 flow [2025-03-04 06:53:12,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 652 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:12,702 INFO L231 Difference]: Finished difference. Result has 635 places, 636 transitions, 1430 flow [2025-03-04 06:53:12,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1430, PETRI_PLACES=635, PETRI_TRANSITIONS=636} [2025-03-04 06:53:12,704 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-03-04 06:53:12,704 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 636 transitions, 1430 flow [2025-03-04 06:53:12,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 655.8333333333334) internal successors, (3935), 6 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:12,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:12,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:12,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:53:12,705 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:12,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:12,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1208287718, now seen corresponding path program 1 times [2025-03-04 06:53:12,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:12,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197665666] [2025-03-04 06:53:12,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:12,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:12,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 06:53:12,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 06:53:12,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:12,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197665666] [2025-03-04 06:53:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197665666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899655451] [2025-03-04 06:53:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:12,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:12,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:12,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:12,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 636 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:12,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:12,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:12,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:13,203 INFO L124 PetriNetUnfolderBase]: 120/3688 cut-off events. [2025-03-04 06:53:13,204 INFO L125 PetriNetUnfolderBase]: For 51/65 co-relation queries the response was YES. [2025-03-04 06:53:13,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 3688 events. 120/3688 cut-off events. For 51/65 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 28954 event pairs, 8 based on Foata normal form. 0/3274 useless extension candidates. Maximal degree in co-relation 3969. Up to 64 conditions per place. [2025-03-04 06:53:13,226 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2025-03-04 06:53:13,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 636 transitions, 1455 flow [2025-03-04 06:53:13,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-03-04 06:53:13,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-03-04 06:53:13,230 INFO L175 Difference]: Start difference. First operand has 635 places, 636 transitions, 1430 flow. Second operand 3 states and 2065 transitions. [2025-03-04 06:53:13,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 636 transitions, 1455 flow [2025-03-04 06:53:13,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 636 transitions, 1455 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:13,238 INFO L231 Difference]: Finished difference. Result has 636 places, 635 transitions, 1432 flow [2025-03-04 06:53:13,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=636, PETRI_TRANSITIONS=635} [2025-03-04 06:53:13,239 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -33 predicate places. [2025-03-04 06:53:13,239 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 635 transitions, 1432 flow [2025-03-04 06:53:13,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:13,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:13,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:13,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:53:13,240 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:13,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2043529144, now seen corresponding path program 1 times [2025-03-04 06:53:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251376896] [2025-03-04 06:53:13,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:13,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 06:53:13,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 06:53:13,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:13,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:13,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:13,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251376896] [2025-03-04 06:53:13,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251376896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:13,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:13,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647909241] [2025-03-04 06:53:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:13,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:13,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:13,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:13,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:13,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 635 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:13,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:13,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:13,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:13,706 INFO L124 PetriNetUnfolderBase]: 122/3650 cut-off events. [2025-03-04 06:53:13,706 INFO L125 PetriNetUnfolderBase]: For 37/49 co-relation queries the response was YES. [2025-03-04 06:53:13,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4028 conditions, 3650 events. 122/3650 cut-off events. For 37/49 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 30153 event pairs, 8 based on Foata normal form. 0/3258 useless extension candidates. Maximal degree in co-relation 3979. Up to 84 conditions per place. [2025-03-04 06:53:13,729 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2025-03-04 06:53:13,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 635 transitions, 1457 flow [2025-03-04 06:53:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-03-04 06:53:13,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-03-04 06:53:13,732 INFO L175 Difference]: Start difference. First operand has 636 places, 635 transitions, 1432 flow. Second operand 3 states and 2065 transitions. [2025-03-04 06:53:13,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 635 transitions, 1457 flow [2025-03-04 06:53:13,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 635 transitions, 1453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:13,743 INFO L231 Difference]: Finished difference. Result has 635 places, 634 transitions, 1430 flow [2025-03-04 06:53:13,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=635, PETRI_TRANSITIONS=634} [2025-03-04 06:53:13,745 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-03-04 06:53:13,745 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 634 transitions, 1430 flow [2025-03-04 06:53:13,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:13,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:13,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:13,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:53:13,746 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:13,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash -866736326, now seen corresponding path program 1 times [2025-03-04 06:53:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:13,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236611590] [2025-03-04 06:53:13,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:13,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:13,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-04 06:53:13,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-04 06:53:13,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:13,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:13,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236611590] [2025-03-04 06:53:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236611590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:13,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:13,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078348044] [2025-03-04 06:53:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:13,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:13,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:13,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:13,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:13,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 713 [2025-03-04 06:53:13,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 634 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:13,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:13,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 713 [2025-03-04 06:53:13,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:14,447 INFO L124 PetriNetUnfolderBase]: 156/5304 cut-off events. [2025-03-04 06:53:14,447 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2025-03-04 06:53:14,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5679 conditions, 5304 events. 156/5304 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 48736 event pairs, 8 based on Foata normal form. 0/4740 useless extension candidates. Maximal degree in co-relation 5630. Up to 96 conditions per place. [2025-03-04 06:53:14,472 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2025-03-04 06:53:14,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 635 transitions, 1457 flow [2025-03-04 06:53:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2069 transitions. [2025-03-04 06:53:14,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672744273024778 [2025-03-04 06:53:14,475 INFO L175 Difference]: Start difference. First operand has 635 places, 634 transitions, 1430 flow. Second operand 3 states and 2069 transitions. [2025-03-04 06:53:14,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 635 transitions, 1457 flow [2025-03-04 06:53:14,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 635 transitions, 1453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:14,483 INFO L231 Difference]: Finished difference. Result has 634 places, 634 transitions, 1436 flow [2025-03-04 06:53:14,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=634, PETRI_TRANSITIONS=634} [2025-03-04 06:53:14,485 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2025-03-04 06:53:14,485 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 634 transitions, 1436 flow [2025-03-04 06:53:14,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:14,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:14,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:14,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:53:14,486 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:14,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1542565570, now seen corresponding path program 1 times [2025-03-04 06:53:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:14,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210772620] [2025-03-04 06:53:14,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:14,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 06:53:14,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 06:53:14,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:14,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210772620] [2025-03-04 06:53:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210772620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:14,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:14,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033665170] [2025-03-04 06:53:14,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:14,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:14,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:14,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:14,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:14,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 634 transitions, 1436 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:14,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:14,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:14,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:15,140 INFO L124 PetriNetUnfolderBase]: 142/4748 cut-off events. [2025-03-04 06:53:15,140 INFO L125 PetriNetUnfolderBase]: For 55/69 co-relation queries the response was YES. [2025-03-04 06:53:15,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 4748 events. 142/4748 cut-off events. For 55/69 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 42453 event pairs, 8 based on Foata normal form. 0/4258 useless extension candidates. Maximal degree in co-relation 5145. Up to 116 conditions per place. [2025-03-04 06:53:15,162 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2025-03-04 06:53:15,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 634 transitions, 1461 flow [2025-03-04 06:53:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-03-04 06:53:15,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-03-04 06:53:15,165 INFO L175 Difference]: Start difference. First operand has 634 places, 634 transitions, 1436 flow. Second operand 3 states and 2065 transitions. [2025-03-04 06:53:15,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 634 transitions, 1461 flow [2025-03-04 06:53:15,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 634 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:15,170 INFO L231 Difference]: Finished difference. Result has 635 places, 633 transitions, 1438 flow [2025-03-04 06:53:15,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=635, PETRI_TRANSITIONS=633} [2025-03-04 06:53:15,171 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-03-04 06:53:15,171 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 633 transitions, 1438 flow [2025-03-04 06:53:15,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:15,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:15,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:15,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:53:15,172 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:15,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:15,173 INFO L85 PathProgramCache]: Analyzing trace with hash 667392524, now seen corresponding path program 1 times [2025-03-04 06:53:15,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:15,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36290382] [2025-03-04 06:53:15,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:15,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:15,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 06:53:15,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 06:53:15,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:15,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:15,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:15,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36290382] [2025-03-04 06:53:15,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36290382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:15,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:15,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:15,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689111232] [2025-03-04 06:53:15,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:15,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:15,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:15,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:15,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 713 [2025-03-04 06:53:15,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 633 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:15,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:15,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 713 [2025-03-04 06:53:15,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:16,075 INFO L124 PetriNetUnfolderBase]: 162/5386 cut-off events. [2025-03-04 06:53:16,075 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2025-03-04 06:53:16,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5845 conditions, 5386 events. 162/5386 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 48995 event pairs, 8 based on Foata normal form. 0/4848 useless extension candidates. Maximal degree in co-relation 5792. Up to 100 conditions per place. [2025-03-04 06:53:16,099 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 23 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2025-03-04 06:53:16,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 634 transitions, 1491 flow [2025-03-04 06:53:16,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2043 transitions. [2025-03-04 06:53:16,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9551192145862553 [2025-03-04 06:53:16,102 INFO L175 Difference]: Start difference. First operand has 635 places, 633 transitions, 1438 flow. Second operand 3 states and 2043 transitions. [2025-03-04 06:53:16,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 634 transitions, 1491 flow [2025-03-04 06:53:16,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 634 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:16,110 INFO L231 Difference]: Finished difference. Result has 634 places, 633 transitions, 1444 flow [2025-03-04 06:53:16,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=634, PETRI_TRANSITIONS=633} [2025-03-04 06:53:16,111 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2025-03-04 06:53:16,111 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 633 transitions, 1444 flow [2025-03-04 06:53:16,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:16,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:16,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:16,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:53:16,112 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:16,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1660692604, now seen corresponding path program 1 times [2025-03-04 06:53:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:16,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270401596] [2025-03-04 06:53:16,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:16,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:16,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 06:53:16,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 06:53:16,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:16,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270401596] [2025-03-04 06:53:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270401596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:16,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:16,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846008159] [2025-03-04 06:53:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:16,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:16,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:16,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:16,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:16,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 713 [2025-03-04 06:53:16,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 633 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:16,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:16,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 713 [2025-03-04 06:53:16,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:17,208 INFO L124 PetriNetUnfolderBase]: 184/6558 cut-off events. [2025-03-04 06:53:17,209 INFO L125 PetriNetUnfolderBase]: For 59/73 co-relation queries the response was YES. [2025-03-04 06:53:17,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7042 conditions, 6558 events. 184/6558 cut-off events. For 59/73 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 65562 event pairs, 4 based on Foata normal form. 0/5918 useless extension candidates. Maximal degree in co-relation 6992. Up to 100 conditions per place. [2025-03-04 06:53:17,270 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 11 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2025-03-04 06:53:17,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 635 transitions, 1476 flow [2025-03-04 06:53:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2025-03-04 06:53:17,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967741935483871 [2025-03-04 06:53:17,272 INFO L175 Difference]: Start difference. First operand has 634 places, 633 transitions, 1444 flow. Second operand 3 states and 2070 transitions. [2025-03-04 06:53:17,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 635 transitions, 1476 flow [2025-03-04 06:53:17,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 635 transitions, 1476 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:17,278 INFO L231 Difference]: Finished difference. Result has 635 places, 633 transitions, 1454 flow [2025-03-04 06:53:17,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=635, PETRI_TRANSITIONS=633} [2025-03-04 06:53:17,279 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-03-04 06:53:17,279 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 633 transitions, 1454 flow [2025-03-04 06:53:17,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:17,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:17,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:17,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 06:53:17,280 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:17,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash -841088669, now seen corresponding path program 1 times [2025-03-04 06:53:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:17,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647659696] [2025-03-04 06:53:17,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:17,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:17,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-04 06:53:17,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-04 06:53:17,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:17,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:17,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647659696] [2025-03-04 06:53:17,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647659696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:17,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:53:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133876020] [2025-03-04 06:53:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:17,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:17,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:17,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:17,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:17,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 713 [2025-03-04 06:53:17,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 633 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:17,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:17,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 713 [2025-03-04 06:53:17,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:18,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][619], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 289#L92-18true, 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 814#true, Black: 756#(<= 2147483647 ~id_0~0), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:18,014 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is not cut-off event [2025-03-04 06:53:18,014 INFO L297 olderBase$Statistics]: existing Event has 412 ancestors and is not cut-off event [2025-03-04 06:53:18,014 INFO L297 olderBase$Statistics]: existing Event has 432 ancestors and is not cut-off event [2025-03-04 06:53:18,014 INFO L297 olderBase$Statistics]: existing Event has 440 ancestors and is not cut-off event [2025-03-04 06:53:18,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][619], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 289#L92-18true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 814#true, Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:18,019 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is not cut-off event [2025-03-04 06:53:18,019 INFO L297 olderBase$Statistics]: existing Event has 444 ancestors and is not cut-off event [2025-03-04 06:53:18,019 INFO L297 olderBase$Statistics]: existing Event has 452 ancestors and is not cut-off event [2025-03-04 06:53:18,019 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is not cut-off event [2025-03-04 06:53:18,020 INFO L124 PetriNetUnfolderBase]: 150/6044 cut-off events. [2025-03-04 06:53:18,020 INFO L125 PetriNetUnfolderBase]: For 53/85 co-relation queries the response was YES. [2025-03-04 06:53:18,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 6044 events. 150/6044 cut-off events. For 53/85 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 59617 event pairs, 12 based on Foata normal form. 2/5520 useless extension candidates. Maximal degree in co-relation 6630. Up to 157 conditions per place. [2025-03-04 06:53:18,056 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 11 selfloop transitions, 3 changer transitions 0/636 dead transitions. [2025-03-04 06:53:18,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 636 transitions, 1489 flow [2025-03-04 06:53:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2025-03-04 06:53:18,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967741935483871 [2025-03-04 06:53:18,058 INFO L175 Difference]: Start difference. First operand has 635 places, 633 transitions, 1454 flow. Second operand 3 states and 2070 transitions. [2025-03-04 06:53:18,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 636 transitions, 1489 flow [2025-03-04 06:53:18,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 636 transitions, 1489 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:18,064 INFO L231 Difference]: Finished difference. Result has 639 places, 635 transitions, 1476 flow [2025-03-04 06:53:18,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=639, PETRI_TRANSITIONS=635} [2025-03-04 06:53:18,065 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -30 predicate places. [2025-03-04 06:53:18,065 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 635 transitions, 1476 flow [2025-03-04 06:53:18,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:18,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:18,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:18,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 06:53:18,066 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:18,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash 718467675, now seen corresponding path program 1 times [2025-03-04 06:53:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:18,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585369003] [2025-03-04 06:53:18,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:18,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 06:53:18,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 06:53:18,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:18,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:18,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585369003] [2025-03-04 06:53:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585369003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:18,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:18,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:18,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507680496] [2025-03-04 06:53:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:18,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:18,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:18,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:18,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 713 [2025-03-04 06:53:18,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 635 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 674.6666666666666) internal successors, (2024), 3 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:18,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:18,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 713 [2025-03-04 06:53:18,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:19,082 INFO L124 PetriNetUnfolderBase]: 160/6416 cut-off events. [2025-03-04 06:53:19,082 INFO L125 PetriNetUnfolderBase]: For 123/137 co-relation queries the response was YES. [2025-03-04 06:53:19,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7164 conditions, 6416 events. 160/6416 cut-off events. For 123/137 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 63268 event pairs, 6 based on Foata normal form. 0/5896 useless extension candidates. Maximal degree in co-relation 7109. Up to 106 conditions per place. [2025-03-04 06:53:19,121 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 24 selfloop transitions, 2 changer transitions 0/637 dead transitions. [2025-03-04 06:53:19,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 637 transitions, 1534 flow [2025-03-04 06:53:19,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2044 transitions. [2025-03-04 06:53:19,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555867227676484 [2025-03-04 06:53:19,123 INFO L175 Difference]: Start difference. First operand has 639 places, 635 transitions, 1476 flow. Second operand 3 states and 2044 transitions. [2025-03-04 06:53:19,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 637 transitions, 1534 flow [2025-03-04 06:53:19,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 637 transitions, 1528 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:19,130 INFO L231 Difference]: Finished difference. Result has 638 places, 635 transitions, 1480 flow [2025-03-04 06:53:19,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=638, PETRI_TRANSITIONS=635} [2025-03-04 06:53:19,132 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -31 predicate places. [2025-03-04 06:53:19,132 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 635 transitions, 1480 flow [2025-03-04 06:53:19,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.6666666666666) internal successors, (2024), 3 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:19,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:19,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:19,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 06:53:19,133 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1280545587, now seen corresponding path program 1 times [2025-03-04 06:53:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539496244] [2025-03-04 06:53:19,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:19,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-04 06:53:19,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-04 06:53:19,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:19,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:19,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:19,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539496244] [2025-03-04 06:53:19,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539496244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:19,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:19,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:53:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628459668] [2025-03-04 06:53:19,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:19,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:19,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:19,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:19,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 713 [2025-03-04 06:53:19,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 635 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:19,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:19,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 713 [2025-03-04 06:53:19,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:19,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 371#L60-52true, Black: 756#(<= 2147483647 ~id_0~0), 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:19,847 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2025-03-04 06:53:19,847 INFO L297 olderBase$Statistics]: existing Event has 409 ancestors and is cut-off event [2025-03-04 06:53:19,847 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-03-04 06:53:19,847 INFO L297 olderBase$Statistics]: existing Event has 417 ancestors and is cut-off event [2025-03-04 06:53:19,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 371#L60-52true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:19,885 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2025-03-04 06:53:19,885 INFO L297 olderBase$Statistics]: existing Event has 421 ancestors and is cut-off event [2025-03-04 06:53:19,885 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2025-03-04 06:53:19,885 INFO L297 olderBase$Statistics]: existing Event has 401 ancestors and is cut-off event [2025-03-04 06:53:19,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][574], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 578#L60-5true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:19,905 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2025-03-04 06:53:19,905 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2025-03-04 06:53:19,905 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2025-03-04 06:53:19,905 INFO L297 olderBase$Statistics]: existing Event has 459 ancestors and is cut-off event [2025-03-04 06:53:19,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][574], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 578#L60-5true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:19,921 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2025-03-04 06:53:19,921 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-03-04 06:53:19,921 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2025-03-04 06:53:19,921 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2025-03-04 06:53:19,931 INFO L124 PetriNetUnfolderBase]: 146/5998 cut-off events. [2025-03-04 06:53:19,931 INFO L125 PetriNetUnfolderBase]: For 91/107 co-relation queries the response was YES. [2025-03-04 06:53:19,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 5998 events. 146/5998 cut-off events. For 91/107 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 56453 event pairs, 10 based on Foata normal form. 0/5526 useless extension candidates. Maximal degree in co-relation 6744. Up to 173 conditions per place. [2025-03-04 06:53:19,981 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 11 selfloop transitions, 3 changer transitions 0/638 dead transitions. [2025-03-04 06:53:19,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 638 transitions, 1515 flow [2025-03-04 06:53:19,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2025-03-04 06:53:19,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967741935483871 [2025-03-04 06:53:19,982 INFO L175 Difference]: Start difference. First operand has 638 places, 635 transitions, 1480 flow. Second operand 3 states and 2070 transitions. [2025-03-04 06:53:19,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 638 transitions, 1515 flow [2025-03-04 06:53:19,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 638 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:19,989 INFO L231 Difference]: Finished difference. Result has 642 places, 637 transitions, 1502 flow [2025-03-04 06:53:19,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=642, PETRI_TRANSITIONS=637} [2025-03-04 06:53:19,990 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -27 predicate places. [2025-03-04 06:53:19,990 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 637 transitions, 1502 flow [2025-03-04 06:53:19,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:19,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:19,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:19,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 06:53:19,991 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:19,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:19,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1116917198, now seen corresponding path program 1 times [2025-03-04 06:53:19,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:19,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789548168] [2025-03-04 06:53:19,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:19,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:20,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-04 06:53:20,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-04 06:53:20,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:20,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:20,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789548168] [2025-03-04 06:53:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789548168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:20,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888523416] [2025-03-04 06:53:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:20,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:20,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:20,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:20,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:20,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 637 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:20,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:20,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:20,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:20,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 289#L92-18true, 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 828#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 756#(<= 2147483647 ~id_0~0), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:20,855 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is not cut-off event [2025-03-04 06:53:20,855 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2025-03-04 06:53:20,855 INFO L297 olderBase$Statistics]: existing Event has 448 ancestors and is not cut-off event [2025-03-04 06:53:20,855 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-03-04 06:53:20,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 289#L92-18true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 828#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:20,857 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is not cut-off event [2025-03-04 06:53:20,857 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-03-04 06:53:20,857 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2025-03-04 06:53:20,857 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2025-03-04 06:53:20,859 INFO L124 PetriNetUnfolderBase]: 112/6394 cut-off events. [2025-03-04 06:53:20,859 INFO L125 PetriNetUnfolderBase]: For 139/179 co-relation queries the response was YES. [2025-03-04 06:53:20,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7344 conditions, 6394 events. 112/6394 cut-off events. For 139/179 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 62686 event pairs, 2 based on Foata normal form. 0/5990 useless extension candidates. Maximal degree in co-relation 7289. Up to 100 conditions per place. [2025-03-04 06:53:20,917 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 12 selfloop transitions, 1 changer transitions 0/638 dead transitions. [2025-03-04 06:53:20,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 638 transitions, 1533 flow [2025-03-04 06:53:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2025-03-04 06:53:20,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663394109396914 [2025-03-04 06:53:20,919 INFO L175 Difference]: Start difference. First operand has 642 places, 637 transitions, 1502 flow. Second operand 3 states and 2067 transitions. [2025-03-04 06:53:20,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 638 transitions, 1533 flow [2025-03-04 06:53:20,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 638 transitions, 1527 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:20,926 INFO L231 Difference]: Finished difference. Result has 640 places, 635 transitions, 1494 flow [2025-03-04 06:53:20,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=640, PETRI_TRANSITIONS=635} [2025-03-04 06:53:20,927 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -29 predicate places. [2025-03-04 06:53:20,927 INFO L471 AbstractCegarLoop]: Abstraction has has 640 places, 635 transitions, 1494 flow [2025-03-04 06:53:20,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:20,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:20,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:20,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 06:53:20,928 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash 384443669, now seen corresponding path program 1 times [2025-03-04 06:53:20,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:20,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913081080] [2025-03-04 06:53:20,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:20,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 06:53:20,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 06:53:20,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:20,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913081080] [2025-03-04 06:53:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913081080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:20,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190057970] [2025-03-04 06:53:20,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:20,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:20,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:20,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:20,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 635 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:20,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:20,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:20,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:21,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][618], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 289#L92-18true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 831#true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 828#true, Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:21,737 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is not cut-off event [2025-03-04 06:53:21,737 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-03-04 06:53:21,737 INFO L297 olderBase$Statistics]: existing Event has 448 ancestors and is not cut-off event [2025-03-04 06:53:21,737 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2025-03-04 06:53:21,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][618], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 289#L92-18true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 831#true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 828#true, Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:21,738 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is not cut-off event [2025-03-04 06:53:21,738 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2025-03-04 06:53:21,738 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2025-03-04 06:53:21,738 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-03-04 06:53:21,740 INFO L124 PetriNetUnfolderBase]: 110/5956 cut-off events. [2025-03-04 06:53:21,740 INFO L125 PetriNetUnfolderBase]: For 69/85 co-relation queries the response was YES. [2025-03-04 06:53:21,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6810 conditions, 5956 events. 110/5956 cut-off events. For 69/85 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 56793 event pairs, 2 based on Foata normal form. 0/5592 useless extension candidates. Maximal degree in co-relation 6755. Up to 100 conditions per place. [2025-03-04 06:53:21,773 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 12 selfloop transitions, 1 changer transitions 0/636 dead transitions. [2025-03-04 06:53:21,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 636 transitions, 1525 flow [2025-03-04 06:53:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2025-03-04 06:53:21,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663394109396914 [2025-03-04 06:53:21,774 INFO L175 Difference]: Start difference. First operand has 640 places, 635 transitions, 1494 flow. Second operand 3 states and 2067 transitions. [2025-03-04 06:53:21,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 636 transitions, 1525 flow [2025-03-04 06:53:21,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 636 transitions, 1524 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:21,780 INFO L231 Difference]: Finished difference. Result has 639 places, 633 transitions, 1491 flow [2025-03-04 06:53:21,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1491, PETRI_PLACES=639, PETRI_TRANSITIONS=633} [2025-03-04 06:53:21,781 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -30 predicate places. [2025-03-04 06:53:21,781 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 633 transitions, 1491 flow [2025-03-04 06:53:21,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:21,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:21,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:21,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 06:53:21,782 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:21,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1259524068, now seen corresponding path program 1 times [2025-03-04 06:53:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842599349] [2025-03-04 06:53:21,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:21,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-04 06:53:21,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-04 06:53:21,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:21,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:21,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842599349] [2025-03-04 06:53:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842599349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:21,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:21,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602402934] [2025-03-04 06:53:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:21,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:21,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:21,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:21,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:21,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 633 transitions, 1491 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:21,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:21,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:21,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:22,631 INFO L124 PetriNetUnfolderBase]: 120/6482 cut-off events. [2025-03-04 06:53:22,631 INFO L125 PetriNetUnfolderBase]: For 107/127 co-relation queries the response was YES. [2025-03-04 06:53:22,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7418 conditions, 6482 events. 120/6482 cut-off events. For 107/127 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 61062 event pairs, 6 based on Foata normal form. 0/6100 useless extension candidates. Maximal degree in co-relation 7363. Up to 108 conditions per place. [2025-03-04 06:53:22,679 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 11 selfloop transitions, 1 changer transitions 0/633 dead transitions. [2025-03-04 06:53:22,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 633 transitions, 1517 flow [2025-03-04 06:53:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2066 transitions. [2025-03-04 06:53:22,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9658719027582983 [2025-03-04 06:53:22,741 INFO L175 Difference]: Start difference. First operand has 639 places, 633 transitions, 1491 flow. Second operand 3 states and 2066 transitions. [2025-03-04 06:53:22,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 633 transitions, 1517 flow [2025-03-04 06:53:22,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 633 transitions, 1516 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:22,747 INFO L231 Difference]: Finished difference. Result has 638 places, 631 transitions, 1488 flow [2025-03-04 06:53:22,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=638, PETRI_TRANSITIONS=631} [2025-03-04 06:53:22,748 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -31 predicate places. [2025-03-04 06:53:22,748 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 631 transitions, 1488 flow [2025-03-04 06:53:22,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:22,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:22,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:22,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 06:53:22,749 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:22,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:22,750 INFO L85 PathProgramCache]: Analyzing trace with hash 778199967, now seen corresponding path program 1 times [2025-03-04 06:53:22,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:22,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39202489] [2025-03-04 06:53:22,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:22,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 06:53:22,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 06:53:22,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:22,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:22,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:22,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39202489] [2025-03-04 06:53:22,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39202489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:22,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:22,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:22,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369088251] [2025-03-04 06:53:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:22,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:22,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:22,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:22,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:22,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:22,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 631 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:22,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:22,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:22,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:23,627 INFO L124 PetriNetUnfolderBase]: 120/6342 cut-off events. [2025-03-04 06:53:23,627 INFO L125 PetriNetUnfolderBase]: For 107/127 co-relation queries the response was YES. [2025-03-04 06:53:23,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7276 conditions, 6342 events. 120/6342 cut-off events. For 107/127 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 59591 event pairs, 6 based on Foata normal form. 0/6000 useless extension candidates. Maximal degree in co-relation 7221. Up to 108 conditions per place. [2025-03-04 06:53:23,668 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 11 selfloop transitions, 1 changer transitions 0/631 dead transitions. [2025-03-04 06:53:23,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 631 transitions, 1514 flow [2025-03-04 06:53:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2066 transitions. [2025-03-04 06:53:23,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9658719027582983 [2025-03-04 06:53:23,669 INFO L175 Difference]: Start difference. First operand has 638 places, 631 transitions, 1488 flow. Second operand 3 states and 2066 transitions. [2025-03-04 06:53:23,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 631 transitions, 1514 flow [2025-03-04 06:53:23,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 631 transitions, 1513 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:23,675 INFO L231 Difference]: Finished difference. Result has 637 places, 629 transitions, 1485 flow [2025-03-04 06:53:23,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1485, PETRI_PLACES=637, PETRI_TRANSITIONS=629} [2025-03-04 06:53:23,676 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -32 predicate places. [2025-03-04 06:53:23,676 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 629 transitions, 1485 flow [2025-03-04 06:53:23,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:23,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:23,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:23,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 06:53:23,677 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:23,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:23,678 INFO L85 PathProgramCache]: Analyzing trace with hash 994174969, now seen corresponding path program 1 times [2025-03-04 06:53:23,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:23,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285543702] [2025-03-04 06:53:23,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:23,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-04 06:53:23,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-04 06:53:23,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:23,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:23,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285543702] [2025-03-04 06:53:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285543702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:23,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:23,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192815457] [2025-03-04 06:53:23,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:23,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:23,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:23,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:23,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 629 transitions, 1485 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:23,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:23,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:23,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:24,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][612], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 837#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 289#L92-18true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:24,623 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2025-03-04 06:53:24,624 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-03-04 06:53:24,624 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-03-04 06:53:24,624 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is not cut-off event [2025-03-04 06:53:24,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][612], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 837#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 289#L92-18true, Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:24,626 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is not cut-off event [2025-03-04 06:53:24,626 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-03-04 06:53:24,626 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-03-04 06:53:24,626 INFO L297 olderBase$Statistics]: existing Event has 496 ancestors and is not cut-off event [2025-03-04 06:53:24,628 INFO L124 PetriNetUnfolderBase]: 116/6104 cut-off events. [2025-03-04 06:53:24,628 INFO L125 PetriNetUnfolderBase]: For 73/141 co-relation queries the response was YES. [2025-03-04 06:53:24,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 6104 events. 116/6104 cut-off events. For 73/141 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 58196 event pairs, 12 based on Foata normal form. 2/5832 useless extension candidates. Maximal degree in co-relation 7123. Up to 196 conditions per place. [2025-03-04 06:53:24,669 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/629 dead transitions. [2025-03-04 06:53:24,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 629 transitions, 1510 flow [2025-03-04 06:53:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-03-04 06:53:24,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-03-04 06:53:24,671 INFO L175 Difference]: Start difference. First operand has 637 places, 629 transitions, 1485 flow. Second operand 3 states and 2065 transitions. [2025-03-04 06:53:24,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 629 transitions, 1510 flow [2025-03-04 06:53:24,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 629 transitions, 1509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:24,679 INFO L231 Difference]: Finished difference. Result has 637 places, 628 transitions, 1486 flow [2025-03-04 06:53:24,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=637, PETRI_TRANSITIONS=628} [2025-03-04 06:53:24,680 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -32 predicate places. [2025-03-04 06:53:24,680 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 628 transitions, 1486 flow [2025-03-04 06:53:24,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:24,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:24,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:24,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 06:53:24,681 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:24,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2140347032, now seen corresponding path program 1 times [2025-03-04 06:53:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:24,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745601075] [2025-03-04 06:53:24,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:24,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:24,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-04 06:53:24,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-04 06:53:24,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:24,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745601075] [2025-03-04 06:53:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745601075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175184927] [2025-03-04 06:53:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:24,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:24,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:24,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:24,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:24,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 628 transitions, 1486 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:24,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:24,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:24,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:25,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][564], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 412#L60-10true, 751#(= |#race~get_5~0| 0), Black: 823#true, Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,443 INFO L294 olderBase$Statistics]: this new event has 470 ancestors and is cut-off event [2025-03-04 06:53:25,443 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is cut-off event [2025-03-04 06:53:25,443 INFO L297 olderBase$Statistics]: existing Event has 454 ancestors and is cut-off event [2025-03-04 06:53:25,443 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is cut-off event [2025-03-04 06:53:25,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][564], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 412#L60-10true, 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,470 INFO L294 olderBase$Statistics]: this new event has 482 ancestors and is cut-off event [2025-03-04 06:53:25,470 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is cut-off event [2025-03-04 06:53:25,470 INFO L297 olderBase$Statistics]: existing Event has 466 ancestors and is cut-off event [2025-03-04 06:53:25,470 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is cut-off event [2025-03-04 06:53:25,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1674] L60-11-->L60-10: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet26#1][529], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 412#L60-10true, Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,487 INFO L294 olderBase$Statistics]: this new event has 454 ancestors and is not cut-off event [2025-03-04 06:53:25,487 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is not cut-off event [2025-03-04 06:53:25,487 INFO L297 olderBase$Statistics]: existing Event has 470 ancestors and is not cut-off event [2025-03-04 06:53:25,487 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is not cut-off event [2025-03-04 06:53:25,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 276#L60-8true, Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 845#(= |#race~result_9~0| |thread2Thread1of1ForFork1_#t~nondet26#1|), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,487 INFO L294 olderBase$Statistics]: this new event has 455 ancestors and is cut-off event [2025-03-04 06:53:25,487 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2025-03-04 06:53:25,487 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2025-03-04 06:53:25,487 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-03-04 06:53:25,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 634#L60-9true, Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 845#(= |#race~result_9~0| |thread2Thread1of1ForFork1_#t~nondet26#1|), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,488 INFO L294 olderBase$Statistics]: this new event has 456 ancestors and is cut-off event [2025-03-04 06:53:25,488 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is cut-off event [2025-03-04 06:53:25,488 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2025-03-04 06:53:25,488 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is cut-off event [2025-03-04 06:53:25,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][564], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, 190#L62true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,492 INFO L294 olderBase$Statistics]: this new event has 465 ancestors and is cut-off event [2025-03-04 06:53:25,492 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is cut-off event [2025-03-04 06:53:25,492 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is cut-off event [2025-03-04 06:53:25,492 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is cut-off event [2025-03-04 06:53:25,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1674] L60-11-->L60-10: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet26#1][529], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 412#L60-10true, 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,493 INFO L294 olderBase$Statistics]: this new event has 466 ancestors and is not cut-off event [2025-03-04 06:53:25,493 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is not cut-off event [2025-03-04 06:53:25,493 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is not cut-off event [2025-03-04 06:53:25,493 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is not cut-off event [2025-03-04 06:53:25,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 276#L60-8true, Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, 845#(= |#race~result_9~0| |thread2Thread1of1ForFork1_#t~nondet26#1|), Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,493 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is cut-off event [2025-03-04 06:53:25,493 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2025-03-04 06:53:25,493 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is cut-off event [2025-03-04 06:53:25,493 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2025-03-04 06:53:25,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 634#L60-9true, Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, 845#(= |#race~result_9~0| |thread2Thread1of1ForFork1_#t~nondet26#1|), Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,494 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is cut-off event [2025-03-04 06:53:25,494 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is cut-off event [2025-03-04 06:53:25,494 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is cut-off event [2025-03-04 06:53:25,494 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is cut-off event [2025-03-04 06:53:25,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][564], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, 190#L62true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:25,497 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-03-04 06:53:25,497 INFO L297 olderBase$Statistics]: existing Event has 485 ancestors and is cut-off event [2025-03-04 06:53:25,497 INFO L297 olderBase$Statistics]: existing Event has 493 ancestors and is cut-off event [2025-03-04 06:53:25,497 INFO L297 olderBase$Statistics]: existing Event has 485 ancestors and is cut-off event [2025-03-04 06:53:25,499 INFO L124 PetriNetUnfolderBase]: 158/6108 cut-off events. [2025-03-04 06:53:25,499 INFO L125 PetriNetUnfolderBase]: For 147/165 co-relation queries the response was YES. [2025-03-04 06:53:25,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 6108 events. 158/6108 cut-off events. For 147/165 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 57911 event pairs, 16 based on Foata normal form. 0/5824 useless extension candidates. Maximal degree in co-relation 7243. Up to 224 conditions per place. [2025-03-04 06:53:25,548 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2025-03-04 06:53:25,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 628 transitions, 1511 flow [2025-03-04 06:53:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-03-04 06:53:25,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-03-04 06:53:25,550 INFO L175 Difference]: Start difference. First operand has 637 places, 628 transitions, 1486 flow. Second operand 3 states and 2065 transitions. [2025-03-04 06:53:25,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 628 transitions, 1511 flow [2025-03-04 06:53:25,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 628 transitions, 1507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:25,557 INFO L231 Difference]: Finished difference. Result has 636 places, 627 transitions, 1484 flow [2025-03-04 06:53:25,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=636, PETRI_TRANSITIONS=627} [2025-03-04 06:53:25,558 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -33 predicate places. [2025-03-04 06:53:25,558 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 627 transitions, 1484 flow [2025-03-04 06:53:25,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:25,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:25,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:25,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 06:53:25,559 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:25,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1526999519, now seen corresponding path program 1 times [2025-03-04 06:53:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:25,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583369702] [2025-03-04 06:53:25,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:25,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:25,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-04 06:53:25,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-04 06:53:25,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:25,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583369702] [2025-03-04 06:53:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583369702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:25,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:25,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:25,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332566898] [2025-03-04 06:53:25,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:25,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:25,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:25,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:25,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:25,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 627 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:25,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:25,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:25,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:26,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 289#L92-18true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:26,316 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2025-03-04 06:53:26,316 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-03-04 06:53:26,316 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is not cut-off event [2025-03-04 06:53:26,316 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-03-04 06:53:26,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1739] thread2EXIT-->L92-18: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 289#L92-18true, Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:26,318 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is not cut-off event [2025-03-04 06:53:26,318 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-03-04 06:53:26,318 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-03-04 06:53:26,318 INFO L297 olderBase$Statistics]: existing Event has 496 ancestors and is not cut-off event [2025-03-04 06:53:26,319 INFO L124 PetriNetUnfolderBase]: 98/5948 cut-off events. [2025-03-04 06:53:26,319 INFO L125 PetriNetUnfolderBase]: For 73/111 co-relation queries the response was YES. [2025-03-04 06:53:26,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 5948 events. 98/5948 cut-off events. For 73/111 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56233 event pairs, 6 based on Foata normal form. 0/5734 useless extension candidates. Maximal degree in co-relation 6879. Up to 124 conditions per place. [2025-03-04 06:53:26,357 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 9 selfloop transitions, 1 changer transitions 0/625 dead transitions. [2025-03-04 06:53:26,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 625 transitions, 1500 flow [2025-03-04 06:53:26,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2025-03-04 06:53:26,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649368863955119 [2025-03-04 06:53:26,358 INFO L175 Difference]: Start difference. First operand has 636 places, 627 transitions, 1484 flow. Second operand 3 states and 2064 transitions. [2025-03-04 06:53:26,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 625 transitions, 1500 flow [2025-03-04 06:53:26,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 625 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:26,365 INFO L231 Difference]: Finished difference. Result has 634 places, 625 transitions, 1478 flow [2025-03-04 06:53:26,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=634, PETRI_TRANSITIONS=625} [2025-03-04 06:53:26,365 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2025-03-04 06:53:26,366 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 625 transitions, 1478 flow [2025-03-04 06:53:26,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:26,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:26,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:26,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 06:53:26,366 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-03-04 06:53:26,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash -810657363, now seen corresponding path program 1 times [2025-03-04 06:53:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:26,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017154743] [2025-03-04 06:53:26,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:26,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-04 06:53:26,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-04 06:53:26,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:26,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017154743] [2025-03-04 06:53:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017154743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:26,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:26,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805754334] [2025-03-04 06:53:26,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:26,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:26,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:26,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-03-04 06:53:26,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 625 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:26,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:26,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-03-04 06:53:26,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:27,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][564], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 276#L60-8true, Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:27,165 INFO L294 olderBase$Statistics]: this new event has 463 ancestors and is cut-off event [2025-03-04 06:53:27,165 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-03-04 06:53:27,165 INFO L297 olderBase$Statistics]: existing Event has 455 ancestors and is cut-off event [2025-03-04 06:53:27,165 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2025-03-04 06:53:27,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1740] thread1EXIT-->L90: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][564], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 276#L60-8true, Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), 849#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:27,180 INFO L294 olderBase$Statistics]: this new event has 475 ancestors and is cut-off event [2025-03-04 06:53:27,180 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2025-03-04 06:53:27,180 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is cut-off event [2025-03-04 06:53:27,180 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is cut-off event [2025-03-04 06:53:27,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1678] L60-10-->L60-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~nondet26#1_3| |v_#race~result_9~0_3|) InVars {thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_3|} AuxVars[] AssignedVars[#race~result_9~0][534], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 276#L60-8true, Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:27,192 INFO L294 olderBase$Statistics]: this new event has 455 ancestors and is not cut-off event [2025-03-04 06:53:27,192 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2025-03-04 06:53:27,192 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is not cut-off event [2025-03-04 06:53:27,192 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2025-03-04 06:53:27,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1678] L60-10-->L60-8: Formula: (= |v_thread2Thread1of1ForFork1_#t~nondet26#1_3| |v_#race~result_9~0_3|) InVars {thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_3|} AuxVars[] AssignedVars[#race~result_9~0][534], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 276#L60-8true, Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 488#L90true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), 849#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-03-04 06:53:27,196 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2025-03-04 06:53:27,196 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is not cut-off event [2025-03-04 06:53:27,196 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is not cut-off event [2025-03-04 06:53:27,196 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is not cut-off event [2025-03-04 06:53:27,200 INFO L124 PetriNetUnfolderBase]: 104/5994 cut-off events. [2025-03-04 06:53:27,200 INFO L125 PetriNetUnfolderBase]: For 93/111 co-relation queries the response was YES. [2025-03-04 06:53:27,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6900 conditions, 5994 events. 104/5994 cut-off events. For 93/111 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56127 event pairs, 8 based on Foata normal form. 8/5784 useless extension candidates. Maximal degree in co-relation 6845. Up to 138 conditions per place. [2025-03-04 06:53:27,241 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 0 selfloop transitions, 0 changer transitions 623/623 dead transitions. [2025-03-04 06:53:27,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 623 transitions, 1492 flow [2025-03-04 06:53:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2025-03-04 06:53:27,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644693782141187 [2025-03-04 06:53:27,242 INFO L175 Difference]: Start difference. First operand has 634 places, 625 transitions, 1478 flow. Second operand 3 states and 2063 transitions. [2025-03-04 06:53:27,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 623 transitions, 1492 flow [2025-03-04 06:53:27,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 623 transitions, 1491 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:27,248 INFO L231 Difference]: Finished difference. Result has 633 places, 0 transitions, 0 flow [2025-03-04 06:53:27,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=633, PETRI_TRANSITIONS=0} [2025-03-04 06:53:27,248 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -36 predicate places. [2025-03-04 06:53:27,249 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 0 transitions, 0 flow [2025-03-04 06:53:27,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:27,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (129 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (128 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (127 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (126 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (125 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (124 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (123 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (122 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (121 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (120 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (119 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (118 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (117 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (116 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (115 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (114 of 130 remaining) [2025-03-04 06:53:27,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (113 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (112 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (111 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (110 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (109 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (108 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (107 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (106 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (105 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (104 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (103 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (102 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (101 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (100 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (99 of 130 remaining) [2025-03-04 06:53:27,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (98 of 130 remaining) [2025-03-04 06:53:27,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (97 of 130 remaining) [2025-03-04 06:53:27,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (96 of 130 remaining) [2025-03-04 06:53:27,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (95 of 130 remaining) [2025-03-04 06:53:27,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (94 of 130 remaining) [2025-03-04 06:53:27,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (93 of 130 remaining) [2025-03-04 06:53:27,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (92 of 130 remaining) [2025-03-04 06:53:27,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (91 of 130 remaining) [2025-03-04 06:53:27,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (90 of 130 remaining) [2025-03-04 06:53:27,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (89 of 130 remaining) [2025-03-04 06:53:27,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (88 of 130 remaining) [2025-03-04 06:53:27,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (87 of 130 remaining) [2025-03-04 06:53:27,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (86 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (85 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (84 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (83 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (82 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (81 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (80 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (79 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (78 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (77 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (76 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (75 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (74 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (73 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (72 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (71 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (70 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (69 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (68 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (67 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (65 of 130 remaining) [2025-03-04 06:53:27,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (64 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (63 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (62 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (61 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (60 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (59 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (58 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (57 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (56 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (55 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (52 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (49 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (48 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (47 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (46 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (45 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (44 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (43 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (42 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (41 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (40 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (39 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (38 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (36 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (34 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (32 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (29 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 130 remaining) [2025-03-04 06:53:27,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (27 of 130 remaining) [2025-03-04 06:53:27,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 130 remaining) [2025-03-04 06:53:27,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 130 remaining) [2025-03-04 06:53:27,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (24 of 130 remaining) [2025-03-04 06:53:27,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 130 remaining) [2025-03-04 06:53:27,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 130 remaining) [2025-03-04 06:53:27,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (21 of 130 remaining) [2025-03-04 06:53:27,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (20 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (11 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (10 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (8 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (7 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (3 of 130 remaining) [2025-03-04 06:53:27,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 130 remaining) [2025-03-04 06:53:27,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 130 remaining) [2025-03-04 06:53:27,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (0 of 130 remaining) [2025-03-04 06:53:27,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 06:53:27,261 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:27,267 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:53:27,267 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:53:27,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:53:27 BasicIcfg [2025-03-04 06:53:27,271 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:53:27,272 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:53:27,272 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:53:27,272 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:53:27,273 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:53:01" (3/4) ... [2025-03-04 06:53:27,274 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:53:27,276 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:53:27,276 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:53:27,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-03-04 06:53:27,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:53:27,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:53:27,283 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:53:27,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:53:27,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:53:27,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:53:27,362 INFO L158 Benchmark]: Toolchain (without parser) took 27014.58ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 123.3MB in the beginning and 670.1MB in the end (delta: -546.8MB). Peak memory consumption was 993.0MB. Max. memory is 16.1GB. [2025-03-04 06:53:27,363 INFO L158 Benchmark]: CDTParser took 4.48ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:53:27,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.29ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 109.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:53:27,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.91ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 105.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:53:27,363 INFO L158 Benchmark]: Boogie Preprocessor took 50.40ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 102.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:53:27,364 INFO L158 Benchmark]: IcfgBuilder took 938.82ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 56.5MB in the end (delta: 46.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 06:53:27,364 INFO L158 Benchmark]: TraceAbstraction took 25613.33ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 55.6MB in the beginning and 678.5MB in the end (delta: -622.9MB). Peak memory consumption was 917.5MB. Max. memory is 16.1GB. [2025-03-04 06:53:27,364 INFO L158 Benchmark]: Witness Printer took 89.67ms. Allocated memory is still 1.7GB. Free memory was 678.5MB in the beginning and 670.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:53:27,365 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.48ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.29ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 109.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.91ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 105.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.40ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 102.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 938.82ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 56.5MB in the end (delta: 46.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25613.33ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 55.6MB in the beginning and 678.5MB in the end (delta: -622.9MB). Peak memory consumption was 917.5MB. Max. memory is 16.1GB. * Witness Printer took 89.67ms. Allocated memory is still 1.7GB. Free memory was 678.5MB in the beginning and 670.1MB 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: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 985 locations, 130 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: 25.4s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2821 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1256 mSDsluCounter, 822 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 547 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3471 IncrementalHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 547 mSolverCounterUnsat, 350 mSDtfsCounter, 3471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1502occurred in iteration=31, InterpolantAutomatonStates: 130, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 8741 NumberOfCodeBlocks, 8741 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 8702 ConstructedInterpolants, 0 QuantifiedInterpolants, 9201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:53:27,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE