./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:30:46,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:30:46,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:30:46,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:30:46,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:30:46,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:30:46,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:30:46,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:30:46,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:30:46,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:30:46,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:30:46,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:30:46,492 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:30:46,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:30:46,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:30:46,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:30:46,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:30:46,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:30:46,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:30:46,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:30:46,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:30:46,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:30:46,493 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:30:46,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:30:46,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:30:46,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:30:46,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:30:46,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:30:46,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:30:46,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:30:46,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:30:46,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:30:46,495 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f [2025-02-06 09:30:46,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:30:46,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:30:46,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:30:46,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:30:46,712 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:30:46,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2025-02-06 09:30:47,946 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3e9a04e2/3583702c684b4fc398e9e6ecc0acdc24/FLAG5d3aef712 [2025-02-06 09:30:48,286 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:30:48,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2025-02-06 09:30:48,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3e9a04e2/3583702c684b4fc398e9e6ecc0acdc24/FLAG5d3aef712 [2025-02-06 09:30:48,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3e9a04e2/3583702c684b4fc398e9e6ecc0acdc24 [2025-02-06 09:30:48,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:30:48,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:30:48,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:30:48,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:30:48,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:30:48,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470d9ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48, skipping insertion in model container [2025-02-06 09:30:48,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:30:48,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:30:48,517 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:30:48,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:30:48,542 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:30:48,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48 WrapperNode [2025-02-06 09:30:48,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:30:48,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:30:48,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:30:48,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:30:48,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,567 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 256 [2025-02-06 09:30:48,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:30:48,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:30:48,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:30:48,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:30:48,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,579 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:30:48,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:30:48,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:30:48,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:30:48,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:30:48,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:30:48,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:30:48,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:30:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:30:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:30:48,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:30:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:30:48,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:30:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:30:48,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:30:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 09:30:48,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 09:30:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:30:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-06 09:30:48,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-06 09:30:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:30:48,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:30:48,637 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:30:48,753 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:30:48,754 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:30:49,048 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:30:49,048 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:30:49,093 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:30:49,094 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:30:49,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:49 BoogieIcfgContainer [2025-02-06 09:30:49,094 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:30:49,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:30:49,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:30:49,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:30:49,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:30:48" (1/3) ... [2025-02-06 09:30:49,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d03db29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:30:49, skipping insertion in model container [2025-02-06 09:30:49,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (2/3) ... [2025-02-06 09:30:49,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d03db29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:30:49, skipping insertion in model container [2025-02-06 09:30:49,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:49" (3/3) ... [2025-02-06 09:30:49,101 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2025-02-06 09:30:49,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:30:49,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-5.wvr.c that has 6 procedures, 271 locations, 1 initial locations, 0 loop locations, and 15 error locations. [2025-02-06 09:30:49,114 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:30:49,182 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-02-06 09:30:49,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 281 transitions, 597 flow [2025-02-06 09:30:49,339 INFO L124 PetriNetUnfolderBase]: 11/276 cut-off events. [2025-02-06 09:30:49,342 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:30:49,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 276 events. 11/276 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 492 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 233. Up to 2 conditions per place. [2025-02-06 09:30:49,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 281 transitions, 597 flow [2025-02-06 09:30:49,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 259 transitions, 545 flow [2025-02-06 09:30:49,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:30:49,374 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;@45d7a932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:30:49,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-06 09:30:49,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:30:49,420 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-02-06 09:30:49,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:30:49,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:49,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:49,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:30:49,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1517675666, now seen corresponding path program 1 times [2025-02-06 09:30:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:49,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140461775] [2025-02-06 09:30:49,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:49,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:49,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 09:30:49,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 09:30:49,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:49,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:49,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:49,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140461775] [2025-02-06 09:30:49,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140461775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:49,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:49,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:49,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893025772] [2025-02-06 09:30:49,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:49,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:49,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:49,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:49,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:49,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-06 09:30:49,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:30:49,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:49,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-06 09:30:49,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:52,738 INFO L124 PetriNetUnfolderBase]: 8140/22951 cut-off events. [2025-02-06 09:30:52,739 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-02-06 09:30:52,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34557 conditions, 22951 events. 8140/22951 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 261196 event pairs, 5691 based on Foata normal form. 1950/21769 useless extension candidates. Maximal degree in co-relation 33945. Up to 10336 conditions per place. [2025-02-06 09:30:52,913 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 34 selfloop transitions, 2 changer transitions 1/252 dead transitions. [2025-02-06 09:30:52,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 252 transitions, 603 flow [2025-02-06 09:30:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2025-02-06 09:30:52,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8837485172004745 [2025-02-06 09:30:52,925 INFO L175 Difference]: Start difference. First operand has 265 places, 259 transitions, 545 flow. Second operand 3 states and 745 transitions. [2025-02-06 09:30:52,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 252 transitions, 603 flow [2025-02-06 09:30:52,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 252 transitions, 586 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-06 09:30:52,942 INFO L231 Difference]: Finished difference. Result has 257 places, 251 transitions, 516 flow [2025-02-06 09:30:52,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=257, PETRI_TRANSITIONS=251} [2025-02-06 09:30:52,946 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -8 predicate places. [2025-02-06 09:30:52,946 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 516 flow [2025-02-06 09:30:52,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:30:52,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:52,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:52,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:30:52,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:30:52,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:52,948 INFO L85 PathProgramCache]: Analyzing trace with hash -879484758, now seen corresponding path program 1 times [2025-02-06 09:30:52,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:52,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737105713] [2025-02-06 09:30:52,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:52,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:52,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:30:52,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:30:52,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:52,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:52,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737105713] [2025-02-06 09:30:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737105713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188646341] [2025-02-06 09:30:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:52,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:52,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:52,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:53,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-06 09:30:53,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:30:53,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:53,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-06 09:30:53,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:55,893 INFO L124 PetriNetUnfolderBase]: 9181/24265 cut-off events. [2025-02-06 09:30:55,894 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2025-02-06 09:30:55,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36917 conditions, 24265 events. 9181/24265 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 270499 event pairs, 6649 based on Foata normal form. 0/21005 useless extension candidates. Maximal degree in co-relation 36881. Up to 11675 conditions per place. [2025-02-06 09:30:56,053 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2025-02-06 09:30:56,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 250 transitions, 586 flow [2025-02-06 09:30:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-02-06 09:30:56,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-02-06 09:30:56,057 INFO L175 Difference]: Start difference. First operand has 257 places, 251 transitions, 516 flow. Second operand 3 states and 739 transitions. [2025-02-06 09:30:56,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 250 transitions, 586 flow [2025-02-06 09:30:56,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 250 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:56,062 INFO L231 Difference]: Finished difference. Result has 255 places, 250 transitions, 514 flow [2025-02-06 09:30:56,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=255, PETRI_TRANSITIONS=250} [2025-02-06 09:30:56,065 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -10 predicate places. [2025-02-06 09:30:56,065 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 514 flow [2025-02-06 09:30:56,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:30:56,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:56,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] [2025-02-06 09:30:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:30:56,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:30:56,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2059546307, now seen corresponding path program 1 times [2025-02-06 09:30:56,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:56,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654631396] [2025-02-06 09:30:56,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:56,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:56,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 09:30:56,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 09:30:56,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:56,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:56,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:56,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654631396] [2025-02-06 09:30:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654631396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:56,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:56,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:56,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994364067] [2025-02-06 09:30:56,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:56,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:56,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:56,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:56,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-06 09:30:56,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:30:56,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:56,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-06 09:30:56,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:58,480 INFO L124 PetriNetUnfolderBase]: 9267/24292 cut-off events. [2025-02-06 09:30:58,480 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2025-02-06 09:30:58,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37061 conditions, 24292 events. 9267/24292 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 270432 event pairs, 6740 based on Foata normal form. 0/20919 useless extension candidates. Maximal degree in co-relation 37017. Up to 11781 conditions per place. [2025-02-06 09:30:58,646 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-02-06 09:30:58,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 249 transitions, 584 flow [2025-02-06 09:30:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-02-06 09:30:58,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-02-06 09:30:58,648 INFO L175 Difference]: Start difference. First operand has 255 places, 250 transitions, 514 flow. Second operand 3 states and 739 transitions. [2025-02-06 09:30:58,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 249 transitions, 584 flow [2025-02-06 09:30:58,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 249 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:58,651 INFO L231 Difference]: Finished difference. Result has 254 places, 249 transitions, 512 flow [2025-02-06 09:30:58,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=254, PETRI_TRANSITIONS=249} [2025-02-06 09:30:58,652 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -11 predicate places. [2025-02-06 09:30:58,652 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 249 transitions, 512 flow [2025-02-06 09:30:58,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:30:58,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:58,653 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] [2025-02-06 09:30:58,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:30:58,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:30:58,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -702689454, now seen corresponding path program 1 times [2025-02-06 09:30:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:58,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206361940] [2025-02-06 09:30:58,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:58,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:30:58,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:30:58,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:58,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206361940] [2025-02-06 09:30:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206361940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123054439] [2025-02-06 09:30:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:58,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:58,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:58,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-06 09:30:58,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 249 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:30:58,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:58,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-06 09:30:58,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:00,588 INFO L124 PetriNetUnfolderBase]: 9706/21096 cut-off events. [2025-02-06 09:31:00,588 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2025-02-06 09:31:00,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34356 conditions, 21096 events. 9706/21096 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 205241 event pairs, 7189 based on Foata normal form. 0/18384 useless extension candidates. Maximal degree in co-relation 34304. Up to 12334 conditions per place. [2025-02-06 09:31:00,742 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2025-02-06 09:31:00,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 582 flow [2025-02-06 09:31:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-02-06 09:31:00,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-02-06 09:31:00,748 INFO L175 Difference]: Start difference. First operand has 254 places, 249 transitions, 512 flow. Second operand 3 states and 739 transitions. [2025-02-06 09:31:00,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 582 flow [2025-02-06 09:31:00,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:00,751 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 510 flow [2025-02-06 09:31:00,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2025-02-06 09:31:00,752 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -12 predicate places. [2025-02-06 09:31:00,752 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 510 flow [2025-02-06 09:31:00,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:31:00,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:00,752 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-02-06 09:31:00,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:31:00,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:00,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:00,753 INFO L85 PathProgramCache]: Analyzing trace with hash -855494839, now seen corresponding path program 1 times [2025-02-06 09:31:00,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:00,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359475954] [2025-02-06 09:31:00,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:00,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:00,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 09:31:00,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 09:31:00,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:00,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:00,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-02-06 09:31:00,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359475954] [2025-02-06 09:31:00,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359475954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:00,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:00,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:00,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420670370] [2025-02-06 09:31:00,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:00,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:00,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:00,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:00,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-06 09:31:00,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:31:00,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:00,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-06 09:31:00,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:03,147 INFO L124 PetriNetUnfolderBase]: 8685/22770 cut-off events. [2025-02-06 09:31:03,148 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2025-02-06 09:31:03,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34475 conditions, 22770 events. 8685/22770 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 248555 event pairs, 6215 based on Foata normal form. 0/19671 useless extension candidates. Maximal degree in co-relation 34415. Up to 11049 conditions per place. [2025-02-06 09:31:03,321 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2025-02-06 09:31:03,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 247 transitions, 580 flow [2025-02-06 09:31:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-02-06 09:31:03,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-02-06 09:31:03,327 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 510 flow. Second operand 3 states and 739 transitions. [2025-02-06 09:31:03,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 247 transitions, 580 flow [2025-02-06 09:31:03,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 247 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:03,334 INFO L231 Difference]: Finished difference. Result has 252 places, 247 transitions, 508 flow [2025-02-06 09:31:03,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=252, PETRI_TRANSITIONS=247} [2025-02-06 09:31:03,335 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -13 predicate places. [2025-02-06 09:31:03,336 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 508 flow [2025-02-06 09:31:03,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-02-06 09:31:03,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:03,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:31:03,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:03,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1687438109, now seen corresponding path program 1 times [2025-02-06 09:31:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286094144] [2025-02-06 09:31:03,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:03,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:31:03,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:31:03,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:03,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:03,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286094144] [2025-02-06 09:31:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286094144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:03,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:03,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:03,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064339476] [2025-02-06 09:31:03,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:03,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:03,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:03,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:03,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:03,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-02-06 09:31:03,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-02-06 09:31:03,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:03,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-02-06 09:31:03,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:06,231 INFO L124 PetriNetUnfolderBase]: 11755/30292 cut-off events. [2025-02-06 09:31:06,231 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2025-02-06 09:31:06,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46458 conditions, 30292 events. 11755/30292 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 345182 event pairs, 6460 based on Foata normal form. 0/26232 useless extension candidates. Maximal degree in co-relation 46390. Up to 11588 conditions per place. [2025-02-06 09:31:06,555 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 49 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-02-06 09:31:06,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 262 transitions, 645 flow [2025-02-06 09:31:06,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-02-06 09:31:06,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015421115065243 [2025-02-06 09:31:06,557 INFO L175 Difference]: Start difference. First operand has 252 places, 247 transitions, 508 flow. Second operand 3 states and 760 transitions. [2025-02-06 09:31:06,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 262 transitions, 645 flow [2025-02-06 09:31:06,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:06,561 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 506 flow [2025-02-06 09:31:06,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2025-02-06 09:31:06,564 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -14 predicate places. [2025-02-06 09:31:06,564 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 506 flow [2025-02-06 09:31:06,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-02-06 09:31:06,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:06,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:06,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:31:06,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:06,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:06,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1385655265, now seen corresponding path program 1 times [2025-02-06 09:31:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:06,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921946122] [2025-02-06 09:31:06,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:06,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:31:06,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:31:06,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:06,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:06,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:06,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921946122] [2025-02-06 09:31:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921946122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:06,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438528775] [2025-02-06 09:31:06,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:06,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:06,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:06,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:06,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-02-06 09:31:06,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-02-06 09:31:06,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:06,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-02-06 09:31:06,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:08,963 INFO L124 PetriNetUnfolderBase]: 10729/21932 cut-off events. [2025-02-06 09:31:08,963 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2025-02-06 09:31:09,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36888 conditions, 21932 events. 10729/21932 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 201195 event pairs, 5362 based on Foata normal form. 0/20327 useless extension candidates. Maximal degree in co-relation 27803. Up to 9906 conditions per place. [2025-02-06 09:31:09,278 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 48 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2025-02-06 09:31:09,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 639 flow [2025-02-06 09:31:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 764 transitions. [2025-02-06 09:31:09,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062870699881376 [2025-02-06 09:31:09,281 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 506 flow. Second operand 3 states and 764 transitions. [2025-02-06 09:31:09,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 639 flow [2025-02-06 09:31:09,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:09,291 INFO L231 Difference]: Finished difference. Result has 250 places, 245 transitions, 502 flow [2025-02-06 09:31:09,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=250, PETRI_TRANSITIONS=245} [2025-02-06 09:31:09,292 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places. [2025-02-06 09:31:09,292 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 245 transitions, 502 flow [2025-02-06 09:31:09,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-02-06 09:31:09,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:09,293 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-02-06 09:31:09,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:31:09,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:09,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1496506874, now seen corresponding path program 1 times [2025-02-06 09:31:09,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:09,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443678889] [2025-02-06 09:31:09,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:09,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 09:31:09,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 09:31:09,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:09,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:09,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:09,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443678889] [2025-02-06 09:31:09,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443678889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:09,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:09,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:09,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138934095] [2025-02-06 09:31:09,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:09,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:09,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:09,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:09,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-02-06 09:31:09,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 245 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-02-06 09:31:09,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:09,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-02-06 09:31:09,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:12,158 INFO L124 PetriNetUnfolderBase]: 14428/32703 cut-off events. [2025-02-06 09:31:12,158 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2025-02-06 09:31:12,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52534 conditions, 32703 events. 14428/32703 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 354661 event pairs, 7947 based on Foata normal form. 0/28649 useless extension candidates. Maximal degree in co-relation 40943. Up to 13745 conditions per place. [2025-02-06 09:31:12,372 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2025-02-06 09:31:12,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 261 transitions, 643 flow [2025-02-06 09:31:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-02-06 09:31:12,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027283511269276 [2025-02-06 09:31:12,375 INFO L175 Difference]: Start difference. First operand has 250 places, 245 transitions, 502 flow. Second operand 3 states and 761 transitions. [2025-02-06 09:31:12,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 261 transitions, 643 flow [2025-02-06 09:31:12,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:12,378 INFO L231 Difference]: Finished difference. Result has 250 places, 244 transitions, 503 flow [2025-02-06 09:31:12,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=503, PETRI_PLACES=250, PETRI_TRANSITIONS=244} [2025-02-06 09:31:12,378 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places. [2025-02-06 09:31:12,379 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 244 transitions, 503 flow [2025-02-06 09:31:12,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-02-06 09:31:12,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:12,379 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] [2025-02-06 09:31:12,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:31:12,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:12,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash 545523976, now seen corresponding path program 1 times [2025-02-06 09:31:12,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:12,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644835900] [2025-02-06 09:31:12,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:12,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:12,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:31:12,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:31:12,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:12,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644835900] [2025-02-06 09:31:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644835900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:12,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:12,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169523792] [2025-02-06 09:31:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:12,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:12,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:12,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:12,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-02-06 09:31:12,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 244 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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-02-06 09:31:12,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:12,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-02-06 09:31:12,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:14,834 INFO L124 PetriNetUnfolderBase]: 11068/25050 cut-off events. [2025-02-06 09:31:14,834 INFO L125 PetriNetUnfolderBase]: For 864/864 co-relation queries the response was YES. [2025-02-06 09:31:14,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40703 conditions, 25050 events. 11068/25050 cut-off events. For 864/864 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 253471 event pairs, 4982 based on Foata normal form. 0/22704 useless extension candidates. Maximal degree in co-relation 31491. Up to 8803 conditions per place. [2025-02-06 09:31:14,983 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2025-02-06 09:31:14,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 260 transitions, 640 flow [2025-02-06 09:31:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-02-06 09:31:14,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074733096085409 [2025-02-06 09:31:14,987 INFO L175 Difference]: Start difference. First operand has 250 places, 244 transitions, 503 flow. Second operand 3 states and 765 transitions. [2025-02-06 09:31:14,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 260 transitions, 640 flow [2025-02-06 09:31:14,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 260 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:15,001 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 499 flow [2025-02-06 09:31:15,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2025-02-06 09:31:15,002 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places. [2025-02-06 09:31:15,002 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 499 flow [2025-02-06 09:31:15,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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-02-06 09:31:15,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:15,003 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] [2025-02-06 09:31:15,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:31:15,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:15,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1116588335, now seen corresponding path program 1 times [2025-02-06 09:31:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232801096] [2025-02-06 09:31:15,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:15,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:31:15,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:31:15,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:15,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232801096] [2025-02-06 09:31:15,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232801096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:15,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:15,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:15,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835074881] [2025-02-06 09:31:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:15,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:15,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:15,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:15,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-02-06 09:31:15,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:15,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:15,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-02-06 09:31:15,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:18,131 INFO L124 PetriNetUnfolderBase]: 14487/31582 cut-off events. [2025-02-06 09:31:18,131 INFO L125 PetriNetUnfolderBase]: For 603/603 co-relation queries the response was YES. [2025-02-06 09:31:18,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51474 conditions, 31582 events. 14487/31582 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 335383 event pairs, 7988 based on Foata normal form. 0/27701 useless extension candidates. Maximal degree in co-relation 40321. Up to 13706 conditions per place. [2025-02-06 09:31:18,332 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-02-06 09:31:18,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 259 transitions, 640 flow [2025-02-06 09:31:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-02-06 09:31:18,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027283511269276 [2025-02-06 09:31:18,334 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 499 flow. Second operand 3 states and 761 transitions. [2025-02-06 09:31:18,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 259 transitions, 640 flow [2025-02-06 09:31:18,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 259 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:18,338 INFO L231 Difference]: Finished difference. Result has 249 places, 242 transitions, 500 flow [2025-02-06 09:31:18,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=249, PETRI_TRANSITIONS=242} [2025-02-06 09:31:18,339 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places. [2025-02-06 09:31:18,339 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 242 transitions, 500 flow [2025-02-06 09:31:18,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:18,339 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] [2025-02-06 09:31:18,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:31:18,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:18,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1212524145, now seen corresponding path program 1 times [2025-02-06 09:31:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688819330] [2025-02-06 09:31:18,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:18,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 09:31:18,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 09:31:18,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:18,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:18,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:18,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688819330] [2025-02-06 09:31:18,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688819330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:18,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:18,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:18,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026412211] [2025-02-06 09:31:18,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:18,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:18,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:18,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:18,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:18,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-02-06 09:31:18,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 242 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-02-06 09:31:18,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:18,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-02-06 09:31:18,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:20,495 INFO L124 PetriNetUnfolderBase]: 10372/25666 cut-off events. [2025-02-06 09:31:20,495 INFO L125 PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES. [2025-02-06 09:31:20,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40457 conditions, 25666 events. 10372/25666 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 278125 event pairs, 3395 based on Foata normal form. 0/22512 useless extension candidates. Maximal degree in co-relation 31513. Up to 7615 conditions per place. [2025-02-06 09:31:20,663 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2025-02-06 09:31:20,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 258 transitions, 637 flow [2025-02-06 09:31:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-02-06 09:31:20,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074733096085409 [2025-02-06 09:31:20,669 INFO L175 Difference]: Start difference. First operand has 249 places, 242 transitions, 500 flow. Second operand 3 states and 765 transitions. [2025-02-06 09:31:20,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 258 transitions, 637 flow [2025-02-06 09:31:20,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 258 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:20,683 INFO L231 Difference]: Finished difference. Result has 248 places, 241 transitions, 496 flow [2025-02-06 09:31:20,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=248, PETRI_TRANSITIONS=241} [2025-02-06 09:31:20,688 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places. [2025-02-06 09:31:20,688 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 241 transitions, 496 flow [2025-02-06 09:31:20,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-02-06 09:31:20,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:20,688 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] [2025-02-06 09:31:20,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:31:20,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:20,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1599397923, now seen corresponding path program 1 times [2025-02-06 09:31:20,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:20,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853285526] [2025-02-06 09:31:20,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:20,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 09:31:20,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 09:31:20,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:20,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:20,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:20,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853285526] [2025-02-06 09:31:20,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853285526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:20,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:20,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326466691] [2025-02-06 09:31:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:20,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:20,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:20,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:20,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-02-06 09:31:20,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 241 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:20,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:20,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-02-06 09:31:20,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:23,343 INFO L124 PetriNetUnfolderBase]: 14972/27283 cut-off events. [2025-02-06 09:31:23,344 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2025-02-06 09:31:23,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47682 conditions, 27283 events. 14972/27283 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 244530 event pairs, 8588 based on Foata normal form. 0/24254 useless extension candidates. Maximal degree in co-relation 37304. Up to 14363 conditions per place. [2025-02-06 09:31:23,808 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2025-02-06 09:31:23,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 257 transitions, 637 flow [2025-02-06 09:31:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-02-06 09:31:23,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027283511269276 [2025-02-06 09:31:23,810 INFO L175 Difference]: Start difference. First operand has 248 places, 241 transitions, 496 flow. Second operand 3 states and 761 transitions. [2025-02-06 09:31:23,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 257 transitions, 637 flow [2025-02-06 09:31:23,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 257 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:23,814 INFO L231 Difference]: Finished difference. Result has 248 places, 240 transitions, 497 flow [2025-02-06 09:31:23,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=248, PETRI_TRANSITIONS=240} [2025-02-06 09:31:23,816 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places. [2025-02-06 09:31:23,816 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 240 transitions, 497 flow [2025-02-06 09:31:23,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:23,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:23,817 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] [2025-02-06 09:31:23,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:31:23,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:23,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash -317926875, now seen corresponding path program 1 times [2025-02-06 09:31:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:23,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353333758] [2025-02-06 09:31:23,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:23,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:23,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 09:31:23,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 09:31:23,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:23,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:23,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:23,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353333758] [2025-02-06 09:31:23,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353333758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:23,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:23,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:23,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747235644] [2025-02-06 09:31:23,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:23,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:23,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:23,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:23,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-02-06 09:31:23,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 240 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:23,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:23,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-02-06 09:31:23,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:25,728 INFO L124 PetriNetUnfolderBase]: 10913/23336 cut-off events. [2025-02-06 09:31:25,728 INFO L125 PetriNetUnfolderBase]: For 956/956 co-relation queries the response was YES. [2025-02-06 09:31:25,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39009 conditions, 23336 events. 10913/23336 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 225346 event pairs, 3900 based on Foata normal form. 0/21011 useless extension candidates. Maximal degree in co-relation 30642. Up to 7428 conditions per place. [2025-02-06 09:31:25,894 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 46 selfloop transitions, 1 changer transitions 6/256 dead transitions. [2025-02-06 09:31:25,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 256 transitions, 634 flow [2025-02-06 09:31:25,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-02-06 09:31:25,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074733096085409 [2025-02-06 09:31:25,896 INFO L175 Difference]: Start difference. First operand has 248 places, 240 transitions, 497 flow. Second operand 3 states and 765 transitions. [2025-02-06 09:31:25,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 256 transitions, 634 flow [2025-02-06 09:31:26,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 256 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:26,086 INFO L231 Difference]: Finished difference. Result has 247 places, 235 transitions, 485 flow [2025-02-06 09:31:26,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=247, PETRI_TRANSITIONS=235} [2025-02-06 09:31:26,087 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -18 predicate places. [2025-02-06 09:31:26,088 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 235 transitions, 485 flow [2025-02-06 09:31:26,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:26,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:26,088 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] [2025-02-06 09:31:26,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:31:26,089 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:31:26,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1769871334, now seen corresponding path program 1 times [2025-02-06 09:31:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717788383] [2025-02-06 09:31:26,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:26,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 09:31:26,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 09:31:26,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:26,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:26,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:26,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717788383] [2025-02-06 09:31:26,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717788383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:26,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:26,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:26,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807398385] [2025-02-06 09:31:26,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:26,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:26,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:26,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:26,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:26,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-02-06 09:31:26,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 235 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 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-02-06 09:31:26,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:26,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-02-06 09:31:26,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand