./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:14:56,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:14:56,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:14:56,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:14:56,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:14:56,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:14:56,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:14:56,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:14:56,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:14:56,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:14:56,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:14:56,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:14:56,782 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:14:56,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:14:56,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:14:56,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:14:56,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:56,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:14:56,784 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2025-03-17 11:14:57,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:14:57,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:14:57,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:14:57,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:14:57,025 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:14:57,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-17 11:14:58,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f32a7eb9/420bdd004eeb4dd28c0460b19d828a01/FLAGd95ab870d [2025-03-17 11:14:58,393 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:14:58,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-17 11:14:58,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f32a7eb9/420bdd004eeb4dd28c0460b19d828a01/FLAGd95ab870d [2025-03-17 11:14:58,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f32a7eb9/420bdd004eeb4dd28c0460b19d828a01 [2025-03-17 11:14:58,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:14:58,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:14:58,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:58,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:14:58,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:14:58,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0bc09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58, skipping insertion in model container [2025-03-17 11:14:58,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:14:58,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:58,605 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:14:58,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:58,645 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:14:58,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58 WrapperNode [2025-03-17 11:14:58,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:58,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:58,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:14:58,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:14:58,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,685 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 180 [2025-03-17 11:14:58,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:58,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:14:58,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:14:58,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:14:58,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:14:58,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:14:58,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:14:58,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:14:58,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:58,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:14:58,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:14:58,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:14:58,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:14:58,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:14:58,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:14:58,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:14:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:14:58,784 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:14:58,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:14:58,866 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:14:59,341 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:14:59,341 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:14:59,431 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:14:59,431 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:14:59,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:59 BoogieIcfgContainer [2025-03-17 11:14:59,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:14:59,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:14:59,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:14:59,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:14:59,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:14:58" (1/3) ... [2025-03-17 11:14:59,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4737ccb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:59, skipping insertion in model container [2025-03-17 11:14:59,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (2/3) ... [2025-03-17 11:14:59,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4737ccb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:59, skipping insertion in model container [2025-03-17 11:14:59,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:59" (3/3) ... [2025-03-17 11:14:59,439 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-03-17 11:14:59,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:14:59,450 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 325 locations, 1 initial locations, 6 loop locations, and 36 error locations. [2025-03-17 11:14:59,451 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:14:59,540 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:14:59,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 341 transitions, 703 flow [2025-03-17 11:14:59,670 INFO L124 PetriNetUnfolderBase]: 17/338 cut-off events. [2025-03-17 11:14:59,673 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:14:59,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 338 events. 17/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 471 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 288. Up to 2 conditions per place. [2025-03-17 11:14:59,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 341 transitions, 703 flow [2025-03-17 11:14:59,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 321 transitions, 660 flow [2025-03-17 11:14:59,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:14:59,700 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;@491c2934, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:14:59,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-17 11:14:59,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:14:59,707 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-17 11:14:59,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:14:59,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:59,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:59,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:14:59,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2019730023, now seen corresponding path program 1 times [2025-03-17 11:14:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:59,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230579503] [2025-03-17 11:14:59,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:59,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:14:59,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:14:59,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:59,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:59,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230579503] [2025-03-17 11:14:59,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230579503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:59,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:59,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:59,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675128731] [2025-03-17 11:14:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:59,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:59,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:59,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:59,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:59,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 341 [2025-03-17 11:14:59,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 321 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:14:59,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:59,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 341 [2025-03-17 11:14:59,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:00,176 INFO L124 PetriNetUnfolderBase]: 85/884 cut-off events. [2025-03-17 11:15:00,176 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 11:15:00,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 884 events. 85/884 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4483 event pairs, 51 based on Foata normal form. 6/746 useless extension candidates. Maximal degree in co-relation 759. Up to 134 conditions per place. [2025-03-17 11:15:00,188 INFO L140 encePairwiseOnDemand]: 317/341 looper letters, 18 selfloop transitions, 2 changer transitions 6/299 dead transitions. [2025-03-17 11:15:00,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 656 flow [2025-03-17 11:15:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-03-17 11:15:00,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-17 11:15:00,205 INFO L175 Difference]: Start difference. First operand has 315 places, 321 transitions, 660 flow. Second operand 3 states and 930 transitions. [2025-03-17 11:15:00,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 656 flow [2025-03-17 11:15:00,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 299 transitions, 644 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:15:00,217 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 596 flow [2025-03-17 11:15:00,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2025-03-17 11:15:00,224 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -17 predicate places. [2025-03-17 11:15:00,224 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 596 flow [2025-03-17 11:15:00,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:00,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:00,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:00,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:15:00,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:00,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1757595171, now seen corresponding path program 1 times [2025-03-17 11:15:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:00,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11579108] [2025-03-17 11:15:00,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:00,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:15:00,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:15:00,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:00,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:00,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11579108] [2025-03-17 11:15:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11579108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:00,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:00,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227274446] [2025-03-17 11:15:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:00,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:00,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:00,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:00,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 341 [2025-03-17 11:15:00,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:00,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:00,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 341 [2025-03-17 11:15:00,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:00,492 INFO L124 PetriNetUnfolderBase]: 213/995 cut-off events. [2025-03-17 11:15:00,492 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-17 11:15:00,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 995 events. 213/995 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5273 event pairs, 128 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 1281. Up to 297 conditions per place. [2025-03-17 11:15:00,498 INFO L140 encePairwiseOnDemand]: 334/341 looper letters, 21 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2025-03-17 11:15:00,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 287 transitions, 628 flow [2025-03-17 11:15:00,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-03-17 11:15:00,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778103616813294 [2025-03-17 11:15:00,500 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 596 flow. Second operand 3 states and 898 transitions. [2025-03-17 11:15:00,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 287 transitions, 628 flow [2025-03-17 11:15:00,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 287 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:00,506 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 582 flow [2025-03-17 11:15:00,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=286, PETRI_TRANSITIONS=287} [2025-03-17 11:15:00,507 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -29 predicate places. [2025-03-17 11:15:00,507 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 582 flow [2025-03-17 11:15:00,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:00,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:00,508 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] [2025-03-17 11:15:00,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:15:00,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:00,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash -796064410, now seen corresponding path program 1 times [2025-03-17 11:15:00,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:00,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867652451] [2025-03-17 11:15:00,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:00,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:00,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:15:00,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:15:00,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:00,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:01,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:01,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867652451] [2025-03-17 11:15:01,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867652451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:01,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:01,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:01,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666796024] [2025-03-17 11:15:01,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:01,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:01,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:01,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:01,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 341 [2025-03-17 11:15:01,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 287 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:01,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:01,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 341 [2025-03-17 11:15:01,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:01,465 INFO L124 PetriNetUnfolderBase]: 130/889 cut-off events. [2025-03-17 11:15:01,466 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-17 11:15:01,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 889 events. 130/889 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4363 event pairs, 100 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1133. Up to 230 conditions per place. [2025-03-17 11:15:01,471 INFO L140 encePairwiseOnDemand]: 323/341 looper letters, 41 selfloop transitions, 15 changer transitions 0/284 dead transitions. [2025-03-17 11:15:01,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 688 flow [2025-03-17 11:15:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1613 transitions. [2025-03-17 11:15:01,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7883675464320625 [2025-03-17 11:15:01,475 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 582 flow. Second operand 6 states and 1613 transitions. [2025-03-17 11:15:01,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 688 flow [2025-03-17 11:15:01,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:01,480 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 605 flow [2025-03-17 11:15:01,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2025-03-17 11:15:01,481 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -28 predicate places. [2025-03-17 11:15:01,481 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 605 flow [2025-03-17 11:15:01,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:01,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:01,482 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] [2025-03-17 11:15:01,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:15:01,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:01,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:01,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1319205259, now seen corresponding path program 1 times [2025-03-17 11:15:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:01,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743439781] [2025-03-17 11:15:01,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:01,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:01,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:15:01,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:15:01,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:01,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:01,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:01,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743439781] [2025-03-17 11:15:01,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743439781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:01,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:01,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:01,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703624193] [2025-03-17 11:15:01,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:01,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:01,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:01,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:01,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 341 [2025-03-17 11:15:01,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:01,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:01,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 341 [2025-03-17 11:15:01,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:01,626 INFO L124 PetriNetUnfolderBase]: 37/389 cut-off events. [2025-03-17 11:15:01,626 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:01,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 389 events. 37/389 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1069 event pairs, 23 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 438. Up to 55 conditions per place. [2025-03-17 11:15:01,628 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 13 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-03-17 11:15:01,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 633 flow [2025-03-17 11:15:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-03-17 11:15:01,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983382209188661 [2025-03-17 11:15:01,631 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 605 flow. Second operand 3 states and 919 transitions. [2025-03-17 11:15:01,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 633 flow [2025-03-17 11:15:01,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 283 transitions, 603 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:01,635 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 577 flow [2025-03-17 11:15:01,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2025-03-17 11:15:01,636 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-03-17 11:15:01,636 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 577 flow [2025-03-17 11:15:01,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:01,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:01,637 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] [2025-03-17 11:15:01,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:15:01,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:01,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash 687940994, now seen corresponding path program 1 times [2025-03-17 11:15:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:01,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688257377] [2025-03-17 11:15:01,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:01,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 11:15:01,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:15:01,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:01,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:01,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-03-17 11:15:01,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:01,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688257377] [2025-03-17 11:15:01,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688257377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:01,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:01,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791517567] [2025-03-17 11:15:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:01,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:01,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:01,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:01,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:01,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 341 [2025-03-17 11:15:01,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:01,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:01,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 341 [2025-03-17 11:15:01,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:01,769 INFO L124 PetriNetUnfolderBase]: 37/388 cut-off events. [2025-03-17 11:15:01,769 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:01,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 388 events. 37/388 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1038 event pairs, 23 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 424. Up to 55 conditions per place. [2025-03-17 11:15:01,771 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-17 11:15:01,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 605 flow [2025-03-17 11:15:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-03-17 11:15:01,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983382209188661 [2025-03-17 11:15:01,774 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 577 flow. Second operand 3 states and 919 transitions. [2025-03-17 11:15:01,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 605 flow [2025-03-17 11:15:01,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 282 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:01,778 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 575 flow [2025-03-17 11:15:01,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2025-03-17 11:15:01,779 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2025-03-17 11:15:01,779 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 575 flow [2025-03-17 11:15:01,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:01,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:01,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:01,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:15:01,781 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:01,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1013250698, now seen corresponding path program 1 times [2025-03-17 11:15:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:01,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504083990] [2025-03-17 11:15:01,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:01,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:01,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 11:15:01,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 11:15:01,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:01,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:01,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:01,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504083990] [2025-03-17 11:15:01,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504083990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:01,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:01,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:01,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071138565] [2025-03-17 11:15:01,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:01,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:01,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:01,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:01,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-17 11:15:01,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:01,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:01,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-17 11:15:01,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:01,926 INFO L124 PetriNetUnfolderBase]: 21/319 cut-off events. [2025-03-17 11:15:01,926 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:01,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 319 events. 21/319 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 588 event pairs, 12 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 332. Up to 35 conditions per place. [2025-03-17 11:15:01,928 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 12 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-17 11:15:01,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 281 transitions, 601 flow [2025-03-17 11:15:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-03-17 11:15:01,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9002932551319648 [2025-03-17 11:15:01,930 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 575 flow. Second operand 3 states and 921 transitions. [2025-03-17 11:15:01,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 281 transitions, 601 flow [2025-03-17 11:15:01,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 281 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:01,934 INFO L231 Difference]: Finished difference. Result has 281 places, 281 transitions, 573 flow [2025-03-17 11:15:01,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=281, PETRI_TRANSITIONS=281} [2025-03-17 11:15:01,935 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -34 predicate places. [2025-03-17 11:15:01,935 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 281 transitions, 573 flow [2025-03-17 11:15:01,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:01,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:01,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:01,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:15:01,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:01,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash -631183672, now seen corresponding path program 1 times [2025-03-17 11:15:01,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:01,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184507947] [2025-03-17 11:15:01,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:01,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 11:15:01,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 11:15:01,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:01,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:01,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184507947] [2025-03-17 11:15:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184507947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940456447] [2025-03-17 11:15:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:01,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:01,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:01,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:01,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-17 11:15:01,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 281 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:01,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:01,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-17 11:15:01,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:02,097 INFO L124 PetriNetUnfolderBase]: 59/519 cut-off events. [2025-03-17 11:15:02,097 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:02,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 519 events. 59/519 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2002 event pairs, 23 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 599. Up to 52 conditions per place. [2025-03-17 11:15:02,100 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 16 selfloop transitions, 3 changer transitions 0/284 dead transitions. [2025-03-17 11:15:02,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 284 transitions, 619 flow [2025-03-17 11:15:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2025-03-17 11:15:02,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.906158357771261 [2025-03-17 11:15:02,102 INFO L175 Difference]: Start difference. First operand has 281 places, 281 transitions, 573 flow. Second operand 3 states and 927 transitions. [2025-03-17 11:15:02,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 284 transitions, 619 flow [2025-03-17 11:15:02,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:02,106 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 571 flow [2025-03-17 11:15:02,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2025-03-17 11:15:02,107 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2025-03-17 11:15:02,107 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 571 flow [2025-03-17 11:15:02,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:02,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:02,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:02,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:15:02,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:02,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -977095127, now seen corresponding path program 1 times [2025-03-17 11:15:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:02,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558251274] [2025-03-17 11:15:02,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:02,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 11:15:02,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 11:15:02,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:02,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:02,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558251274] [2025-03-17 11:15:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558251274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:02,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:02,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150347280] [2025-03-17 11:15:02,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:02,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:02,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:02,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:02,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 341 [2025-03-17 11:15:02,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:02,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:02,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 341 [2025-03-17 11:15:02,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:02,258 INFO L124 PetriNetUnfolderBase]: 76/765 cut-off events. [2025-03-17 11:15:02,258 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 11:15:02,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 765 events. 76/765 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3496 event pairs, 8 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 878. Up to 99 conditions per place. [2025-03-17 11:15:02,262 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 19 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-03-17 11:15:02,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 287 transitions, 634 flow [2025-03-17 11:15:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2025-03-17 11:15:02,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9159335288367546 [2025-03-17 11:15:02,264 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 571 flow. Second operand 3 states and 937 transitions. [2025-03-17 11:15:02,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 287 transitions, 634 flow [2025-03-17 11:15:02,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 287 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:02,272 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 577 flow [2025-03-17 11:15:02,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2025-03-17 11:15:02,273 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2025-03-17 11:15:02,274 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 577 flow [2025-03-17 11:15:02,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:02,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:02,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:15:02,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:02,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:02,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1983485100, now seen corresponding path program 1 times [2025-03-17 11:15:02,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:02,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512850126] [2025-03-17 11:15:02,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:02,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:02,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 11:15:02,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:15:02,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:02,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512850126] [2025-03-17 11:15:02,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512850126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:02,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:02,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:02,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864926513] [2025-03-17 11:15:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:02,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:02,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:02,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:02,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 341 [2025-03-17 11:15:02,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 577 flow. Second operand has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:02,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:02,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 341 [2025-03-17 11:15:02,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:03,058 INFO L124 PetriNetUnfolderBase]: 202/1252 cut-off events. [2025-03-17 11:15:03,058 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-17 11:15:03,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 1252 events. 202/1252 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5654 event pairs, 96 based on Foata normal form. 9/1179 useless extension candidates. Maximal degree in co-relation 1748. Up to 201 conditions per place. [2025-03-17 11:15:03,065 INFO L140 encePairwiseOnDemand]: 312/341 looper letters, 52 selfloop transitions, 42 changer transitions 0/331 dead transitions. [2025-03-17 11:15:03,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 331 transitions, 885 flow [2025-03-17 11:15:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:15:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:15:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2852 transitions. [2025-03-17 11:15:03,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2025-03-17 11:15:03,070 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 577 flow. Second operand 10 states and 2852 transitions. [2025-03-17 11:15:03,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 331 transitions, 885 flow [2025-03-17 11:15:03,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 331 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:03,074 INFO L231 Difference]: Finished difference. Result has 292 places, 305 transitions, 769 flow [2025-03-17 11:15:03,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=769, PETRI_PLACES=292, PETRI_TRANSITIONS=305} [2025-03-17 11:15:03,075 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2025-03-17 11:15:03,075 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 305 transitions, 769 flow [2025-03-17 11:15:03,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:03,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:03,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:03,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:15:03,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:03,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:03,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1642138514, now seen corresponding path program 1 times [2025-03-17 11:15:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982650701] [2025-03-17 11:15:03,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:03,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 11:15:03,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 11:15:03,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:03,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:03,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982650701] [2025-03-17 11:15:03,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982650701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:03,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:03,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:03,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382792861] [2025-03-17 11:15:03,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:03,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:03,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:03,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:03,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:03,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 341 [2025-03-17 11:15:03,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 305 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:03,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:03,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 341 [2025-03-17 11:15:03,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:03,221 INFO L124 PetriNetUnfolderBase]: 90/783 cut-off events. [2025-03-17 11:15:03,221 INFO L125 PetriNetUnfolderBase]: For 77/80 co-relation queries the response was YES. [2025-03-17 11:15:03,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 783 events. 90/783 cut-off events. For 77/80 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2575 event pairs, 32 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 1037. Up to 120 conditions per place. [2025-03-17 11:15:03,225 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 11 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2025-03-17 11:15:03,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 304 transitions, 791 flow [2025-03-17 11:15:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-03-17 11:15:03,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-17 11:15:03,227 INFO L175 Difference]: Start difference. First operand has 292 places, 305 transitions, 769 flow. Second operand 3 states and 930 transitions. [2025-03-17 11:15:03,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 304 transitions, 791 flow [2025-03-17 11:15:03,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 304 transitions, 791 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:03,233 INFO L231 Difference]: Finished difference. Result has 293 places, 304 transitions, 769 flow [2025-03-17 11:15:03,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=293, PETRI_TRANSITIONS=304} [2025-03-17 11:15:03,234 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2025-03-17 11:15:03,234 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 304 transitions, 769 flow [2025-03-17 11:15:03,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:03,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:03,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:15:03,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:03,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash -174807128, now seen corresponding path program 1 times [2025-03-17 11:15:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608417388] [2025-03-17 11:15:03,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:03,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 11:15:03,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 11:15:03,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:03,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:03,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:03,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608417388] [2025-03-17 11:15:03,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608417388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:03,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:03,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:03,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285205039] [2025-03-17 11:15:03,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:03,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:03,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:03,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:03,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:03,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-17 11:15:03,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 304 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:03,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:03,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-17 11:15:03,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:03,409 INFO L124 PetriNetUnfolderBase]: 136/970 cut-off events. [2025-03-17 11:15:03,409 INFO L125 PetriNetUnfolderBase]: For 98/99 co-relation queries the response was YES. [2025-03-17 11:15:03,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 970 events. 136/970 cut-off events. For 98/99 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3921 event pairs, 39 based on Foata normal form. 4/916 useless extension candidates. Maximal degree in co-relation 1330. Up to 141 conditions per place. [2025-03-17 11:15:03,414 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 15 selfloop transitions, 2 changer transitions 28/307 dead transitions. [2025-03-17 11:15:03,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 307 transitions, 817 flow [2025-03-17 11:15:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-03-17 11:15:03,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9051808406647116 [2025-03-17 11:15:03,416 INFO L175 Difference]: Start difference. First operand has 293 places, 304 transitions, 769 flow. Second operand 3 states and 926 transitions. [2025-03-17 11:15:03,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 307 transitions, 817 flow [2025-03-17 11:15:03,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:03,420 INFO L231 Difference]: Finished difference. Result has 292 places, 274 transitions, 644 flow [2025-03-17 11:15:03,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=292, PETRI_TRANSITIONS=274} [2025-03-17 11:15:03,420 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2025-03-17 11:15:03,421 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 274 transitions, 644 flow [2025-03-17 11:15:03,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:03,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:03,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:03,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:15:03,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:03,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2133437555, now seen corresponding path program 1 times [2025-03-17 11:15:03,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:03,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421174229] [2025-03-17 11:15:03,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:03,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:03,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 11:15:03,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 11:15:03,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:03,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:15:03,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:03,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421174229] [2025-03-17 11:15:03,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421174229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:03,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:03,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:03,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712451938] [2025-03-17 11:15:03,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:03,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:03,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:03,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:03,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 341 [2025-03-17 11:15:03,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 274 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:03,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:03,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 341 [2025-03-17 11:15:03,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:04,480 INFO L124 PetriNetUnfolderBase]: 231/1287 cut-off events. [2025-03-17 11:15:04,480 INFO L125 PetriNetUnfolderBase]: For 159/166 co-relation queries the response was YES. [2025-03-17 11:15:04,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 1287 events. 231/1287 cut-off events. For 159/166 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7344 event pairs, 74 based on Foata normal form. 0/1197 useless extension candidates. Maximal degree in co-relation 1900. Up to 282 conditions per place. [2025-03-17 11:15:04,487 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 47 selfloop transitions, 10 changer transitions 0/299 dead transitions. [2025-03-17 11:15:04,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 299 transitions, 824 flow [2025-03-17 11:15:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2025-03-17 11:15:04,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8665689149560117 [2025-03-17 11:15:04,491 INFO L175 Difference]: Start difference. First operand has 292 places, 274 transitions, 644 flow. Second operand 6 states and 1773 transitions. [2025-03-17 11:15:04,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 299 transitions, 824 flow [2025-03-17 11:15:04,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 299 transitions, 768 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-17 11:15:04,496 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 668 flow [2025-03-17 11:15:04,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2025-03-17 11:15:04,497 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2025-03-17 11:15:04,497 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 668 flow [2025-03-17 11:15:04,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:04,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:04,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:04,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:15:04,499 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:04,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1111153717, now seen corresponding path program 1 times [2025-03-17 11:15:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:04,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651857264] [2025-03-17 11:15:04,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:04,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 11:15:04,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 11:15:04,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:04,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:15:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651857264] [2025-03-17 11:15:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651857264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:04,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777106615] [2025-03-17 11:15:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:04,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:04,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:04,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:04,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-17 11:15:04,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:04,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:04,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-17 11:15:04,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:04,764 INFO L124 PetriNetUnfolderBase]: 283/1423 cut-off events. [2025-03-17 11:15:04,764 INFO L125 PetriNetUnfolderBase]: For 823/835 co-relation queries the response was YES. [2025-03-17 11:15:04,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2408 conditions, 1423 events. 283/1423 cut-off events. For 823/835 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8243 event pairs, 84 based on Foata normal form. 0/1307 useless extension candidates. Maximal degree in co-relation 2370. Up to 293 conditions per place. [2025-03-17 11:15:04,774 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 22 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-03-17 11:15:04,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 288 transitions, 738 flow [2025-03-17 11:15:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-03-17 11:15:04,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042033235581622 [2025-03-17 11:15:04,776 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 668 flow. Second operand 3 states and 925 transitions. [2025-03-17 11:15:04,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 288 transitions, 738 flow [2025-03-17 11:15:04,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 288 transitions, 728 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:04,781 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 662 flow [2025-03-17 11:15:04,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2025-03-17 11:15:04,783 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-03-17 11:15:04,783 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 662 flow [2025-03-17 11:15:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:04,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:04,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:04,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:15:04,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:04,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1970333272, now seen corresponding path program 1 times [2025-03-17 11:15:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721330863] [2025-03-17 11:15:04,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:04,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 11:15:04,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 11:15:04,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:04,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:15:04,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:04,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721330863] [2025-03-17 11:15:04,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721330863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:04,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:04,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:04,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191572203] [2025-03-17 11:15:04,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:04,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:04,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:04,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:04,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 341 [2025-03-17 11:15:04,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:04,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:04,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 341 [2025-03-17 11:15:04,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:04,993 INFO L124 PetriNetUnfolderBase]: 194/1198 cut-off events. [2025-03-17 11:15:04,993 INFO L125 PetriNetUnfolderBase]: For 421/431 co-relation queries the response was YES. [2025-03-17 11:15:04,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 1198 events. 194/1198 cut-off events. For 421/431 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6452 event pairs, 4 based on Foata normal form. 0/1127 useless extension candidates. Maximal degree in co-relation 1871. Up to 220 conditions per place. [2025-03-17 11:15:05,000 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 21 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2025-03-17 11:15:05,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 293 transitions, 764 flow [2025-03-17 11:15:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2025-03-17 11:15:05,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139784946236559 [2025-03-17 11:15:05,002 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 662 flow. Second operand 3 states and 935 transitions. [2025-03-17 11:15:05,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 293 transitions, 764 flow [2025-03-17 11:15:05,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:05,006 INFO L231 Difference]: Finished difference. Result has 283 places, 287 transitions, 721 flow [2025-03-17 11:15:05,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=283, PETRI_TRANSITIONS=287} [2025-03-17 11:15:05,007 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-03-17 11:15:05,007 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 287 transitions, 721 flow [2025-03-17 11:15:05,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:05,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:05,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:05,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:15:05,008 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:05,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1004354840, now seen corresponding path program 1 times [2025-03-17 11:15:05,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:05,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237941672] [2025-03-17 11:15:05,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:05,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:05,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 11:15:05,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:15:05,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:05,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:15:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237941672] [2025-03-17 11:15:06,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237941672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:06,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:06,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-17 11:15:06,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757724085] [2025-03-17 11:15:06,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:06,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:15:06,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:06,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:15:06,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:15:08,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 341 [2025-03-17 11:15:08,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 287 transitions, 721 flow. Second operand has 22 states, 22 states have (on average 254.45454545454547) internal successors, (5598), 22 states have internal predecessors, (5598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:08,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:08,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 341 [2025-03-17 11:15:08,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:10,514 INFO L124 PetriNetUnfolderBase]: 1226/4757 cut-off events. [2025-03-17 11:15:10,514 INFO L125 PetriNetUnfolderBase]: For 2170/2283 co-relation queries the response was YES. [2025-03-17 11:15:10,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8406 conditions, 4757 events. 1226/4757 cut-off events. For 2170/2283 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 39798 event pairs, 307 based on Foata normal form. 62/4432 useless extension candidates. Maximal degree in co-relation 8363. Up to 689 conditions per place. [2025-03-17 11:15:10,545 INFO L140 encePairwiseOnDemand]: 306/341 looper letters, 105 selfloop transitions, 53 changer transitions 4/369 dead transitions. [2025-03-17 11:15:10,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 369 transitions, 1430 flow [2025-03-17 11:15:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 11:15:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-17 11:15:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8436 transitions. [2025-03-17 11:15:10,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7496667555318581 [2025-03-17 11:15:10,558 INFO L175 Difference]: Start difference. First operand has 283 places, 287 transitions, 721 flow. Second operand 33 states and 8436 transitions. [2025-03-17 11:15:10,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 369 transitions, 1430 flow [2025-03-17 11:15:10,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 369 transitions, 1430 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:10,565 INFO L231 Difference]: Finished difference. Result has 320 places, 308 transitions, 1023 flow [2025-03-17 11:15:10,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1023, PETRI_PLACES=320, PETRI_TRANSITIONS=308} [2025-03-17 11:15:10,566 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 5 predicate places. [2025-03-17 11:15:10,566 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 308 transitions, 1023 flow [2025-03-17 11:15:10,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 254.45454545454547) internal successors, (5598), 22 states have internal predecessors, (5598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:10,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:10,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:10,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:15:10,568 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash -938674320, now seen corresponding path program 2 times [2025-03-17 11:15:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642547754] [2025-03-17 11:15:10,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:15:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:10,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:15:10,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 160 of 202 statements. [2025-03-17 11:15:10,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:15:10,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:15:11,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:11,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642547754] [2025-03-17 11:15:11,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642547754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:11,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:11,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 11:15:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173468946] [2025-03-17 11:15:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:11,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:15:11,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:11,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:15:11,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:15:12,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 341 [2025-03-17 11:15:12,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 308 transitions, 1023 flow. Second operand has 20 states, 20 states have (on average 256.6) internal successors, (5132), 20 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:12,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:12,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 341 [2025-03-17 11:15:12,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:14,667 INFO L124 PetriNetUnfolderBase]: 1245/5462 cut-off events. [2025-03-17 11:15:14,668 INFO L125 PetriNetUnfolderBase]: For 5364/5513 co-relation queries the response was YES. [2025-03-17 11:15:14,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10977 conditions, 5462 events. 1245/5462 cut-off events. For 5364/5513 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 48903 event pairs, 223 based on Foata normal form. 93/5142 useless extension candidates. Maximal degree in co-relation 10928. Up to 851 conditions per place. [2025-03-17 11:15:14,703 INFO L140 encePairwiseOnDemand]: 306/341 looper letters, 84 selfloop transitions, 74 changer transitions 0/369 dead transitions. [2025-03-17 11:15:14,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 369 transitions, 1707 flow [2025-03-17 11:15:14,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 11:15:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-17 11:15:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8488 transitions. [2025-03-17 11:15:14,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542877454900915 [2025-03-17 11:15:14,711 INFO L175 Difference]: Start difference. First operand has 320 places, 308 transitions, 1023 flow. Second operand 33 states and 8488 transitions. [2025-03-17 11:15:14,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 369 transitions, 1707 flow [2025-03-17 11:15:14,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 369 transitions, 1656 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-17 11:15:14,722 INFO L231 Difference]: Finished difference. Result has 327 places, 336 transitions, 1421 flow [2025-03-17 11:15:14,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1421, PETRI_PLACES=327, PETRI_TRANSITIONS=336} [2025-03-17 11:15:14,723 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 12 predicate places. [2025-03-17 11:15:14,723 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 336 transitions, 1421 flow [2025-03-17 11:15:14,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 256.6) internal successors, (5132), 20 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:14,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:14,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:14,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:15:14,725 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:14,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash 806145307, now seen corresponding path program 1 times [2025-03-17 11:15:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:14,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307891723] [2025-03-17 11:15:14,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:14,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:14,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 11:15:14,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 11:15:14,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:14,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:15:15,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:15,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307891723] [2025-03-17 11:15:15,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307891723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:15,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:15,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:15,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530569539] [2025-03-17 11:15:15,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:15,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:15,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:15,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:15,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:15,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 341 [2025-03-17 11:15:15,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 336 transitions, 1421 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:15,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:15,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 341 [2025-03-17 11:15:15,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:16,035 INFO L124 PetriNetUnfolderBase]: 1531/6031 cut-off events. [2025-03-17 11:15:16,035 INFO L125 PetriNetUnfolderBase]: For 10361/10496 co-relation queries the response was YES. [2025-03-17 11:15:16,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13857 conditions, 6031 events. 1531/6031 cut-off events. For 10361/10496 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 54154 event pairs, 353 based on Foata normal form. 87/5740 useless extension candidates. Maximal degree in co-relation 13806. Up to 1206 conditions per place. [2025-03-17 11:15:16,067 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 74 selfloop transitions, 23 changer transitions 0/369 dead transitions. [2025-03-17 11:15:16,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 369 transitions, 1783 flow [2025-03-17 11:15:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1771 transitions. [2025-03-17 11:15:16,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655913978494624 [2025-03-17 11:15:16,070 INFO L175 Difference]: Start difference. First operand has 327 places, 336 transitions, 1421 flow. Second operand 6 states and 1771 transitions. [2025-03-17 11:15:16,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 369 transitions, 1783 flow [2025-03-17 11:15:16,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 369 transitions, 1700 flow, removed 16 selfloop flow, removed 26 redundant places. [2025-03-17 11:15:16,088 INFO L231 Difference]: Finished difference. Result has 311 places, 353 transitions, 1582 flow [2025-03-17 11:15:16,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1582, PETRI_PLACES=311, PETRI_TRANSITIONS=353} [2025-03-17 11:15:16,089 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -4 predicate places. [2025-03-17 11:15:16,089 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 353 transitions, 1582 flow [2025-03-17 11:15:16,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:16,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:16,090 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:16,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:15:16,090 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:16,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1553847419, now seen corresponding path program 1 times [2025-03-17 11:15:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:16,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157345074] [2025-03-17 11:15:16,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:16,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 11:15:16,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 11:15:16,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:16,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:15:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:16,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157345074] [2025-03-17 11:15:16,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157345074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:15:16,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562699767] [2025-03-17 11:15:16,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:16,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:16,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:16,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:15:16,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:15:16,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 11:15:16,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 11:15:16,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:16,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:16,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:15:16,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:15:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:15:16,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:15:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:15:17,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562699767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:15:17,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:15:17,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-17 11:15:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410592836] [2025-03-17 11:15:17,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:15:17,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:15:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:17,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:15:17,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:15:17,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 341 [2025-03-17 11:15:17,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 353 transitions, 1582 flow. Second operand has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:17,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:17,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 341 [2025-03-17 11:15:17,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:19,920 INFO L124 PetriNetUnfolderBase]: 3014/10540 cut-off events. [2025-03-17 11:15:19,920 INFO L125 PetriNetUnfolderBase]: For 21775/23166 co-relation queries the response was YES. [2025-03-17 11:15:19,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26042 conditions, 10540 events. 3014/10540 cut-off events. For 21775/23166 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 102694 event pairs, 1181 based on Foata normal form. 391/10304 useless extension candidates. Maximal degree in co-relation 25986. Up to 2723 conditions per place. [2025-03-17 11:15:19,999 INFO L140 encePairwiseOnDemand]: 299/341 looper letters, 137 selfloop transitions, 95 changer transitions 0/488 dead transitions. [2025-03-17 11:15:19,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 488 transitions, 2696 flow [2025-03-17 11:15:20,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:15:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-17 11:15:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6226 transitions. [2025-03-17 11:15:20,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7938288920056101 [2025-03-17 11:15:20,004 INFO L175 Difference]: Start difference. First operand has 311 places, 353 transitions, 1582 flow. Second operand 23 states and 6226 transitions. [2025-03-17 11:15:20,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 488 transitions, 2696 flow [2025-03-17 11:15:20,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 488 transitions, 2664 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:20,051 INFO L231 Difference]: Finished difference. Result has 346 places, 417 transitions, 2199 flow [2025-03-17 11:15:20,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2199, PETRI_PLACES=346, PETRI_TRANSITIONS=417} [2025-03-17 11:15:20,052 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 31 predicate places. [2025-03-17 11:15:20,052 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 417 transitions, 2199 flow [2025-03-17 11:15:20,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:20,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:20,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:20,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:15:20,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 11:15:20,259 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:20,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1781084707, now seen corresponding path program 1 times [2025-03-17 11:15:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376986179] [2025-03-17 11:15:20,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:20,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 11:15:20,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 11:15:20,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:20,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-17 11:15:20,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:20,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376986179] [2025-03-17 11:15:20,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376986179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:20,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:20,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:20,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50028360] [2025-03-17 11:15:20,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:20,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:20,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:20,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:20,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:20,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-17 11:15:20,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 417 transitions, 2199 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:20,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:20,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-17 11:15:20,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:21,968 INFO L124 PetriNetUnfolderBase]: 2439/10363 cut-off events. [2025-03-17 11:15:21,968 INFO L125 PetriNetUnfolderBase]: For 20311/20702 co-relation queries the response was YES. [2025-03-17 11:15:22,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26000 conditions, 10363 events. 2439/10363 cut-off events. For 20311/20702 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 102744 event pairs, 826 based on Foata normal form. 63/9966 useless extension candidates. Maximal degree in co-relation 25929. Up to 2055 conditions per place. [2025-03-17 11:15:22,055 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 42 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-03-17 11:15:22,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 423 transitions, 2323 flow [2025-03-17 11:15:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-03-17 11:15:22,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022482893450635 [2025-03-17 11:15:22,059 INFO L175 Difference]: Start difference. First operand has 346 places, 417 transitions, 2199 flow. Second operand 3 states and 923 transitions. [2025-03-17 11:15:22,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 423 transitions, 2323 flow [2025-03-17 11:15:22,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 423 transitions, 2291 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:22,120 INFO L231 Difference]: Finished difference. Result has 346 places, 416 transitions, 2169 flow [2025-03-17 11:15:22,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2169, PETRI_PLACES=346, PETRI_TRANSITIONS=416} [2025-03-17 11:15:22,121 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 31 predicate places. [2025-03-17 11:15:22,121 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 416 transitions, 2169 flow [2025-03-17 11:15:22,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:22,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:22,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:22,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:15:22,122 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:22,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:22,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1920497914, now seen corresponding path program 1 times [2025-03-17 11:15:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:22,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547342212] [2025-03-17 11:15:22,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:22,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-17 11:15:22,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 11:15:22,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:22,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:15:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547342212] [2025-03-17 11:15:22,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547342212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:15:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491334859] [2025-03-17 11:15:22,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:22,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:22,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:22,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:15:22,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:15:22,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-17 11:15:23,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 11:15:23,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:23,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:23,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 11:15:23,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:15:23,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:15:23,115 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:15:23,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:15:23,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2025-03-17 11:15:23,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2025-03-17 11:15:23,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2025-03-17 11:15:23,381 INFO L349 Elim1Store]: treesize reduction 458, result has 0.2 percent of original size [2025-03-17 11:15:23,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 43 [2025-03-17 11:15:23,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-17 11:15:23,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2025-03-17 11:15:23,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 45 [2025-03-17 11:15:23,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2025-03-17 11:15:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:15:23,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:15:23,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:23,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-17 11:15:23,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:23,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-17 11:15:23,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2025-03-17 11:15:23,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:23,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2025-03-17 11:15:23,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-17 11:15:23,532 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:23,538 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:23,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-17 11:15:23,541 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:23,546 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:23,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-17 11:15:23,549 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:23,555 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:23,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-17 11:15:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:15:23,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491334859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:15:23,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:15:23,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-17 11:15:23,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131768663] [2025-03-17 11:15:23,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:15:23,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:15:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:23,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:15:23,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:15:25,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 341 [2025-03-17 11:15:25,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 416 transitions, 2169 flow. Second operand has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:25,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:25,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 341 [2025-03-17 11:15:25,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:26,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L51-5-->L51-6: Formula: (let ((.cse0 (select |v_#race_1| v_~B~0.base_1)) (.cse1 (* v_thread1Thread1of1ForFork0_~i~0_33 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_1 1)) 0) (= (select .cse0 (+ 2 .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ 3 .cse1 v_~B~0.offset_1)) 0))) InVars {#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} OutVars{#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} AuxVars[] AssignedVars[][355], [408#(= |#race~B~0| 0), Black: 570#true, Black: 375#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 572#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), 1898#true, Black: 574#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 397#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 573#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 395#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 396#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 394#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), 588#(<= ~N~0 1), Black: 392#true, 483#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 242#L96-1true, Black: 406#true, 82#L65true, Black: 1856#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1884#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 1854#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1882#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 1862#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1)), Black: 1872#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), 575#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1860#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 1866#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 589#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 477#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 475#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1876#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 1864#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1)), Black: 479#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1164#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 481#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 361#true, 363#(= |#race~A~0| 0), 150#L51-6true, 3262#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| ~B~0.base)) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset)) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (= (select (select |#race| ~B~0.base) ~B~0.offset) 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 1)) 0) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 560#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 556#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 558#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 554#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 206#L78-2true, 562#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 342#(= |#race~N~0| 0)]) [2025-03-17 11:15:26,539 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is not cut-off event [2025-03-17 11:15:26,539 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-03-17 11:15:26,539 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is not cut-off event [2025-03-17 11:15:26,539 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-03-17 11:15:27,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L51-5-->L51-6: Formula: (let ((.cse0 (select |v_#race_1| v_~B~0.base_1)) (.cse1 (* v_thread1Thread1of1ForFork0_~i~0_33 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_1 1)) 0) (= (select .cse0 (+ 2 .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ 3 .cse1 v_~B~0.offset_1)) 0))) InVars {#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} OutVars{#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} AuxVars[] AssignedVars[][355], [Black: 570#true, 408#(= |#race~B~0| 0), Black: 375#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 572#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), 1898#true, Black: 574#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 397#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 573#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 395#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 396#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 394#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), Black: 392#true, 483#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 242#L96-1true, Black: 406#true, 82#L65true, Black: 1856#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1884#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 1854#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1882#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 1862#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1)), Black: 1872#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 588#(<= ~N~0 1), Black: 1860#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), 575#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1866#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 589#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 477#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 475#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1876#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 1864#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1)), Black: 479#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1164#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 481#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 361#true, 363#(= |#race~A~0| 0), 150#L51-6true, 3262#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| ~B~0.base)) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset)) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (= (select (select |#race| ~B~0.base) ~B~0.offset) 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 1)) 0) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 560#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 556#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 558#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 581#true, Black: 554#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 206#L78-2true, 562#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 342#(= |#race~N~0| 0)]) [2025-03-17 11:15:27,456 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is not cut-off event [2025-03-17 11:15:27,456 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is not cut-off event [2025-03-17 11:15:27,456 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is not cut-off event [2025-03-17 11:15:27,456 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is not cut-off event [2025-03-17 11:15:28,010 INFO L124 PetriNetUnfolderBase]: 3396/12612 cut-off events. [2025-03-17 11:15:28,011 INFO L125 PetriNetUnfolderBase]: For 30593/31651 co-relation queries the response was YES. [2025-03-17 11:15:28,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31889 conditions, 12612 events. 3396/12612 cut-off events. For 30593/31651 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 124957 event pairs, 655 based on Foata normal form. 462/12279 useless extension candidates. Maximal degree in co-relation 31814. Up to 1634 conditions per place. [2025-03-17 11:15:28,096 INFO L140 encePairwiseOnDemand]: 309/341 looper letters, 151 selfloop transitions, 83 changer transitions 0/507 dead transitions. [2025-03-17 11:15:28,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 507 transitions, 3307 flow [2025-03-17 11:15:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 11:15:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-17 11:15:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6554 transitions. [2025-03-17 11:15:28,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7687976539589443 [2025-03-17 11:15:28,100 INFO L175 Difference]: Start difference. First operand has 346 places, 416 transitions, 2169 flow. Second operand 25 states and 6554 transitions. [2025-03-17 11:15:28,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 507 transitions, 3307 flow [2025-03-17 11:15:28,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 507 transitions, 3303 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:28,157 INFO L231 Difference]: Finished difference. Result has 373 places, 432 transitions, 2600 flow [2025-03-17 11:15:28,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2600, PETRI_PLACES=373, PETRI_TRANSITIONS=432} [2025-03-17 11:15:28,158 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 58 predicate places. [2025-03-17 11:15:28,158 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 432 transitions, 2600 flow [2025-03-17 11:15:28,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:28,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:28,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:28,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:15:28,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-17 11:15:28,364 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:28,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1383151760, now seen corresponding path program 2 times [2025-03-17 11:15:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:28,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508781847] [2025-03-17 11:15:28,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:15:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:28,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-03-17 11:15:28,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 11:15:28,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:15:28,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:15:29,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:29,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508781847] [2025-03-17 11:15:29,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508781847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:15:29,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049587530] [2025-03-17 11:15:29,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:15:29,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:29,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:29,166 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:15:29,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:15:29,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-03-17 11:15:29,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 11:15:29,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:15:29,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:29,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:15:29,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:15:29,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:15:29,588 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:15:29,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:15:29,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2025-03-17 11:15:29,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 89 [2025-03-17 11:15:29,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2025-03-17 11:15:29,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 45 [2025-03-17 11:15:29,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2025-03-17 11:15:29,931 INFO L349 Elim1Store]: treesize reduction 458, result has 0.2 percent of original size [2025-03-17 11:15:29,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 43 [2025-03-17 11:15:29,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-17 11:15:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:15:29,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:15:30,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:30,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-17 11:15:30,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-17 11:15:30,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:30,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-17 11:15:30,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:30,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2025-03-17 11:15:30,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-17 11:15:30,068 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:30,074 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:30,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-17 11:15:30,076 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:30,080 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:30,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-17 11:15:30,082 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:30,088 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:30,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-17 11:15:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:15:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049587530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:15:30,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:15:30,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 37 [2025-03-17 11:15:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051086457] [2025-03-17 11:15:30,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:15:30,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 11:15:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:30,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 11:15:30,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 11:15:33,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 341 [2025-03-17 11:15:33,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 432 transitions, 2600 flow. Second operand has 38 states, 38 states have (on average 208.94736842105263) internal successors, (7940), 38 states have internal predecessors, (7940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:33,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:33,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 341 [2025-03-17 11:15:33,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,651 INFO L124 PetriNetUnfolderBase]: 3474/14332 cut-off events. [2025-03-17 11:15:37,651 INFO L125 PetriNetUnfolderBase]: For 51706/53160 co-relation queries the response was YES. [2025-03-17 11:15:37,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40631 conditions, 14332 events. 3474/14332 cut-off events. For 51706/53160 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 148788 event pairs, 822 based on Foata normal form. 727/14761 useless extension candidates. Maximal degree in co-relation 40549. Up to 2412 conditions per place. [2025-03-17 11:15:37,757 INFO L140 encePairwiseOnDemand]: 288/341 looper letters, 148 selfloop transitions, 148 changer transitions 0/520 dead transitions. [2025-03-17 11:15:37,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 520 transitions, 3911 flow [2025-03-17 11:15:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 11:15:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-17 11:15:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 7705 transitions. [2025-03-17 11:15:37,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.610683997780772 [2025-03-17 11:15:37,762 INFO L175 Difference]: Start difference. First operand has 373 places, 432 transitions, 2600 flow. Second operand 37 states and 7705 transitions. [2025-03-17 11:15:37,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 520 transitions, 3911 flow [2025-03-17 11:15:37,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 520 transitions, 3848 flow, removed 1 selfloop flow, removed 19 redundant places. [2025-03-17 11:15:37,878 INFO L231 Difference]: Finished difference. Result has 394 places, 458 transitions, 3264 flow [2025-03-17 11:15:37,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=3264, PETRI_PLACES=394, PETRI_TRANSITIONS=458} [2025-03-17 11:15:37,878 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 79 predicate places. [2025-03-17 11:15:37,878 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 458 transitions, 3264 flow [2025-03-17 11:15:37,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 208.94736842105263) internal successors, (7940), 38 states have internal predecessors, (7940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:37,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,880 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:37,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:15:38,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:38,081 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:38,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1889548090, now seen corresponding path program 1 times [2025-03-17 11:15:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453881291] [2025-03-17 11:15:38,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 11:15:38,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 11:15:38,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 11:15:38,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453881291] [2025-03-17 11:15:38,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453881291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:15:38,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62423558] [2025-03-17 11:15:38,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:38,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:38,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:15:38,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:15:38,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 11:15:38,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 11:15:38,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:15:38,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:15:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 11:15:38,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:15:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 11:15:39,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62423558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:15:39,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:15:39,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-17 11:15:39,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128005671] [2025-03-17 11:15:39,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:15:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:15:39,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:15:40,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 341 [2025-03-17 11:15:40,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 458 transitions, 3264 flow. Second operand has 24 states, 24 states have (on average 267.0) internal successors, (6408), 24 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:40,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:40,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 341 [2025-03-17 11:15:40,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:43,161 INFO L124 PetriNetUnfolderBase]: 2281/10472 cut-off events. [2025-03-17 11:15:43,161 INFO L125 PetriNetUnfolderBase]: For 42831/43043 co-relation queries the response was YES. [2025-03-17 11:15:43,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30661 conditions, 10472 events. 2281/10472 cut-off events. For 42831/43043 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 101551 event pairs, 685 based on Foata normal form. 90/10146 useless extension candidates. Maximal degree in co-relation 30578. Up to 1662 conditions per place. [2025-03-17 11:15:43,286 INFO L140 encePairwiseOnDemand]: 299/341 looper letters, 97 selfloop transitions, 44 changer transitions 156/567 dead transitions. [2025-03-17 11:15:43,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 567 transitions, 4864 flow [2025-03-17 11:15:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:15:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-17 11:15:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6238 transitions. [2025-03-17 11:15:43,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953589187810787 [2025-03-17 11:15:43,293 INFO L175 Difference]: Start difference. First operand has 394 places, 458 transitions, 3264 flow. Second operand 23 states and 6238 transitions. [2025-03-17 11:15:43,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 567 transitions, 4864 flow [2025-03-17 11:15:43,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 567 transitions, 4713 flow, removed 22 selfloop flow, removed 29 redundant places. [2025-03-17 11:15:43,419 INFO L231 Difference]: Finished difference. Result has 392 places, 398 transitions, 2651 flow [2025-03-17 11:15:43,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3040, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2651, PETRI_PLACES=392, PETRI_TRANSITIONS=398} [2025-03-17 11:15:43,420 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 77 predicate places. [2025-03-17 11:15:43,420 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 398 transitions, 2651 flow [2025-03-17 11:15:43,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.0) internal successors, (6408), 24 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:43,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:43,422 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:43,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:15:43,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:43,623 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-17 11:15:43,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1194410604, now seen corresponding path program 2 times [2025-03-17 11:15:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:43,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196784504] [2025-03-17 11:15:43,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:15:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:43,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-03-17 11:15:43,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 11:15:43,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:15:43,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:15:45,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196784504] [2025-03-17 11:15:45,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196784504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:15:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221183220] [2025-03-17 11:15:45,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:15:45,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:45,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:45,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:15:45,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:15:45,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-03-17 11:15:46,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 11:15:46,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:15:46,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:46,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-17 11:15:46,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:15:46,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:15:46,378 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 11:15:46,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 11:15:46,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:15:46,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:15:47,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:15:47,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 11:15:47,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 11:15:47,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-17 11:15:47,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:15:47,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:15:47,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:15:47,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:15:47,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 91 [2025-03-17 11:15:47,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 60 [2025-03-17 11:15:47,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:15:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:15:47,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:15:47,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:15:47,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 96 [2025-03-17 11:15:47,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2025-03-17 11:15:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:15:51,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:15:52,367 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2025-03-17 11:15:52,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 121 [2025-03-17 11:15:52,375 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-03-17 11:15:52,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 256 treesize of output 168 [2025-03-17 11:15:52,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-17 11:15:52,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2025-03-17 11:15:52,397 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2025-03-17 11:15:52,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2025-03-17 11:15:52,409 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2025-03-17 11:15:52,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 1 [2025-03-17 11:15:52,420 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2025-03-17 11:15:52,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2025-03-17 11:15:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:15:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221183220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:15:53,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:15:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 21] total 75 [2025-03-17 11:15:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101672496] [2025-03-17 11:15:53,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:15:53,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-17 11:15:53,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:53,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-17 11:15:53,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=5255, Unknown=124, NotChecked=0, Total=5700 [2025-03-17 11:15:57,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2025-03-17 11:15:57,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 398 transitions, 2651 flow. Second operand has 76 states, 76 states have (on average 159.51315789473685) internal successors, (12123), 76 states have internal predecessors, (12123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:15:57,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:57,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2025-03-17 11:15:57,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand