./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:32:26,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:32:26,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:32:26,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:32:26,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:32:26,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:32:26,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:32:26,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:32:26,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:32:26,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:32:26,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:32:26,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:32:26,730 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:32:26,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:32:26,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:32:26,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:32:26,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:32:26,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:32:26,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:32:26,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:32:26,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:32:26,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:32:26,733 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:32:26,733 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:32:26,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:32:26,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:32:26,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:32:26,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:32:26,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:32:26,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:32:26,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:32:26,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:32:26,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:32:26,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:32:26,735 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:32:26,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:32:26,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:32:26,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:32:26,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:32:26,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:32:26,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:32:26,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:32:26,736 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2025-02-06 09:32:27,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:32:27,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:32:27,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:32:27,075 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:32:27,075 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:32:27,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-02-06 09:32:28,540 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c806804f/ab0eb48c6efd40eea817467abf5ea177/FLAG6ec0b1f65 [2025-02-06 09:32:28,862 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:32:28,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-02-06 09:32:28,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c806804f/ab0eb48c6efd40eea817467abf5ea177/FLAG6ec0b1f65 [2025-02-06 09:32:28,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c806804f/ab0eb48c6efd40eea817467abf5ea177 [2025-02-06 09:32:28,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:32:28,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:32:28,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:32:28,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:32:28,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:32:28,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:32:28" (1/1) ... [2025-02-06 09:32:28,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fad818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:28, skipping insertion in model container [2025-02-06 09:32:28,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:32:28" (1/1) ... [2025-02-06 09:32:28,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:32:29,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:32:29,118 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:32:29,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:32:29,166 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:32:29,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29 WrapperNode [2025-02-06 09:32:29,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:32:29,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:32:29,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:32:29,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:32:29,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,204 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 180 [2025-02-06 09:32:29,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:32:29,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:32:29,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:32:29,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:32:29,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:32:29,258 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:32:29,259 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:32:29,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:32:29,260 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (1/1) ... [2025-02-06 09:32:29,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:32:29,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:32:29,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:32:29,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:32:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:32:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:32:29,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:32:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:32:29,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:32:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:32:29,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:32:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:32:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:32:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 09:32:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 09:32:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:32:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:32:29,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:32:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:32:29,332 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:32:29,437 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:32:29,438 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:32:30,006 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:32:30,007 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:32:30,137 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:32:30,138 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:32:30,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:30 BoogieIcfgContainer [2025-02-06 09:32:30,140 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:32:30,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:32:30,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:32:30,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:32:30,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:32:28" (1/3) ... [2025-02-06 09:32:30,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29055a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:32:30, skipping insertion in model container [2025-02-06 09:32:30,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:29" (2/3) ... [2025-02-06 09:32:30,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29055a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:32:30, skipping insertion in model container [2025-02-06 09:32:30,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:30" (3/3) ... [2025-02-06 09:32:30,151 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-02-06 09:32:30,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:32:30,168 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-02-06 09:32:30,168 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:32:30,296 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:32:30,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 341 transitions, 703 flow [2025-02-06 09:32:30,456 INFO L124 PetriNetUnfolderBase]: 17/338 cut-off events. [2025-02-06 09:32:30,460 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:32:30,468 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-02-06 09:32:30,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 341 transitions, 703 flow [2025-02-06 09:32:30,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 321 transitions, 660 flow [2025-02-06 09:32:30,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:32:30,507 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;@3b9df358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:32:30,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-02-06 09:32:30,517 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:32:30,517 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-06 09:32:30,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:32:30,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:30,518 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-02-06 09:32:30,519 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-02-06 09:32:30,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1511404121, now seen corresponding path program 1 times [2025-02-06 09:32:30,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:30,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546684507] [2025-02-06 09:32:30,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:30,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 09:32:30,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:32:30,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:30,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:30,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:30,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546684507] [2025-02-06 09:32:30,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546684507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:30,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:30,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:30,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837279440] [2025-02-06 09:32:30,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:30,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:30,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:30,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:30,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:30,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 341 [2025-02-06 09:32:30,825 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-02-06 09:32:30,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:30,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 341 [2025-02-06 09:32:30,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:31,183 INFO L124 PetriNetUnfolderBase]: 85/884 cut-off events. [2025-02-06 09:32:31,183 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-02-06 09:32:31,192 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 4525 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-02-06 09:32:31,200 INFO L140 encePairwiseOnDemand]: 317/341 looper letters, 18 selfloop transitions, 2 changer transitions 6/299 dead transitions. [2025-02-06 09:32:31,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 656 flow [2025-02-06 09:32:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-02-06 09:32:31,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-02-06 09:32:31,225 INFO L175 Difference]: Start difference. First operand has 315 places, 321 transitions, 660 flow. Second operand 3 states and 930 transitions. [2025-02-06 09:32:31,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 656 flow [2025-02-06 09:32:31,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 299 transitions, 644 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:32:31,240 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 596 flow [2025-02-06 09:32:31,243 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-02-06 09:32:31,247 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -17 predicate places. [2025-02-06 09:32:31,249 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 596 flow [2025-02-06 09:32:31,250 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-02-06 09:32:31,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:31,250 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-02-06 09:32:31,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:32:31,251 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-02-06 09:32:31,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash -599509574, now seen corresponding path program 1 times [2025-02-06 09:32:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:31,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732734828] [2025-02-06 09:32:31,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:31,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:32:31,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:32:31,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:31,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:31,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:31,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732734828] [2025-02-06 09:32:31,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732734828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:31,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:31,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:31,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10118429] [2025-02-06 09:32:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:31,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:31,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:31,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:31,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 341 [2025-02-06 09:32:31,364 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-02-06 09:32:31,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:31,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 341 [2025-02-06 09:32:31,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:31,630 INFO L124 PetriNetUnfolderBase]: 213/995 cut-off events. [2025-02-06 09:32:31,630 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 09:32:31,634 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 5256 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-02-06 09:32:31,641 INFO L140 encePairwiseOnDemand]: 334/341 looper letters, 21 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2025-02-06 09:32:31,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 287 transitions, 628 flow [2025-02-06 09:32:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-02-06 09:32:31,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778103616813294 [2025-02-06 09:32:31,645 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 596 flow. Second operand 3 states and 898 transitions. [2025-02-06 09:32:31,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 287 transitions, 628 flow [2025-02-06 09:32:31,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 287 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:31,652 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 582 flow [2025-02-06 09:32:31,655 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-02-06 09:32:31,656 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -29 predicate places. [2025-02-06 09:32:31,656 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 582 flow [2025-02-06 09:32:31,656 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-02-06 09:32:31,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:31,657 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-02-06 09:32:31,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:32:31,657 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-02-06 09:32:31,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:31,658 INFO L85 PathProgramCache]: Analyzing trace with hash 230068609, now seen corresponding path program 1 times [2025-02-06 09:32:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329116444] [2025-02-06 09:32:31,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:31,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:32:31,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:32:31,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:31,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329116444] [2025-02-06 09:32:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329116444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:32:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482763246] [2025-02-06 09:32:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:32,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:32:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:32,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:32:32,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:32:32,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 341 [2025-02-06 09:32:32,787 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-02-06 09:32:32,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:32,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 341 [2025-02-06 09:32:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:33,106 INFO L124 PetriNetUnfolderBase]: 130/889 cut-off events. [2025-02-06 09:32:33,106 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 09:32:33,110 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 4386 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-02-06 09:32:33,115 INFO L140 encePairwiseOnDemand]: 323/341 looper letters, 41 selfloop transitions, 15 changer transitions 0/284 dead transitions. [2025-02-06 09:32:33,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 688 flow [2025-02-06 09:32:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:32:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:32:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1613 transitions. [2025-02-06 09:32:33,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7883675464320625 [2025-02-06 09:32:33,122 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 582 flow. Second operand 6 states and 1613 transitions. [2025-02-06 09:32:33,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 688 flow [2025-02-06 09:32:33,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:33,129 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 605 flow [2025-02-06 09:32:33,130 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-02-06 09:32:33,131 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -28 predicate places. [2025-02-06 09:32:33,131 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 605 flow [2025-02-06 09:32:33,132 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-02-06 09:32:33,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:33,132 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-02-06 09:32:33,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:32:33,133 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-02-06 09:32:33,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1114254746, now seen corresponding path program 1 times [2025-02-06 09:32:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982806686] [2025-02-06 09:32:33,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:33,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:33,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:32:33,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:32:33,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:33,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:33,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982806686] [2025-02-06 09:32:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982806686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:33,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068221171] [2025-02-06 09:32:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:33,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:33,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:33,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:33,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 341 [2025-02-06 09:32:33,201 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-02-06 09:32:33,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:33,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 341 [2025-02-06 09:32:33,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:33,307 INFO L124 PetriNetUnfolderBase]: 37/389 cut-off events. [2025-02-06 09:32:33,307 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:32:33,309 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 1081 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-02-06 09:32:33,310 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 13 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-02-06 09:32:33,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 633 flow [2025-02-06 09:32:33,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-02-06 09:32:33,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983382209188661 [2025-02-06 09:32:33,313 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 605 flow. Second operand 3 states and 919 transitions. [2025-02-06 09:32:33,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 633 flow [2025-02-06 09:32:33,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 283 transitions, 603 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:32:33,317 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 577 flow [2025-02-06 09:32:33,318 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-02-06 09:32:33,319 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-02-06 09:32:33,319 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 577 flow [2025-02-06 09:32:33,319 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-02-06 09:32:33,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:33,320 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-02-06 09:32:33,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:32:33,320 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-02-06 09:32:33,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash -744180188, now seen corresponding path program 1 times [2025-02-06 09:32:33,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:33,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777740724] [2025-02-06 09:32:33,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:33,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:33,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:32:33,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:32:33,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:33,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777740724] [2025-02-06 09:32:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777740724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:33,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117610251] [2025-02-06 09:32:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:33,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:33,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:33,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:33,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 341 [2025-02-06 09:32:33,397 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-02-06 09:32:33,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:33,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 341 [2025-02-06 09:32:33,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:33,465 INFO L124 PetriNetUnfolderBase]: 37/388 cut-off events. [2025-02-06 09:32:33,466 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:32:33,467 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 1060 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-02-06 09:32:33,469 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-02-06 09:32:33,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 605 flow [2025-02-06 09:32:33,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-02-06 09:32:33,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983382209188661 [2025-02-06 09:32:33,472 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 577 flow. Second operand 3 states and 919 transitions. [2025-02-06 09:32:33,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 605 flow [2025-02-06 09:32:33,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 282 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:33,476 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 575 flow [2025-02-06 09:32:33,477 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-02-06 09:32:33,478 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2025-02-06 09:32:33,478 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 575 flow [2025-02-06 09:32:33,479 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-02-06 09:32:33,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:33,479 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-02-06 09:32:33,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:32:33,479 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-02-06 09:32:33,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1189391878, now seen corresponding path program 1 times [2025-02-06 09:32:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:33,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446024898] [2025-02-06 09:32:33,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:33,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 09:32:33,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 09:32:33,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:33,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:33,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:33,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446024898] [2025-02-06 09:32:33,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446024898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:33,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:33,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:33,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050239975] [2025-02-06 09:32:33,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:33,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:33,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:33,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:33,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-02-06 09:32:33,593 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-02-06 09:32:33,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:33,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-02-06 09:32:33,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:33,653 INFO L124 PetriNetUnfolderBase]: 21/319 cut-off events. [2025-02-06 09:32:33,654 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:32:33,655 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 590 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-02-06 09:32:33,656 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 12 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-02-06 09:32:33,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 281 transitions, 601 flow [2025-02-06 09:32:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-02-06 09:32:33,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9002932551319648 [2025-02-06 09:32:33,660 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 575 flow. Second operand 3 states and 921 transitions. [2025-02-06 09:32:33,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 281 transitions, 601 flow [2025-02-06 09:32:33,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 281 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:33,664 INFO L231 Difference]: Finished difference. Result has 281 places, 281 transitions, 573 flow [2025-02-06 09:32:33,664 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-02-06 09:32:33,665 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -34 predicate places. [2025-02-06 09:32:33,665 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 281 transitions, 573 flow [2025-02-06 09:32:33,667 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-02-06 09:32:33,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:33,667 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-02-06 09:32:33,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:32:33,667 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-02-06 09:32:33,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:33,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1284512868, now seen corresponding path program 1 times [2025-02-06 09:32:33,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:33,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579441632] [2025-02-06 09:32:33,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 09:32:33,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 09:32:33,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:33,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:33,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:33,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579441632] [2025-02-06 09:32:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579441632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:33,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:33,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:33,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496564038] [2025-02-06 09:32:33,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:33,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:33,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:33,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:33,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:33,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-02-06 09:32:33,760 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-02-06 09:32:33,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:33,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-02-06 09:32:33,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:33,873 INFO L124 PetriNetUnfolderBase]: 59/519 cut-off events. [2025-02-06 09:32:33,873 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:32:33,875 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 2017 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-02-06 09:32:33,877 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 16 selfloop transitions, 3 changer transitions 0/284 dead transitions. [2025-02-06 09:32:33,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 284 transitions, 619 flow [2025-02-06 09:32:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2025-02-06 09:32:33,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.906158357771261 [2025-02-06 09:32:33,880 INFO L175 Difference]: Start difference. First operand has 281 places, 281 transitions, 573 flow. Second operand 3 states and 927 transitions. [2025-02-06 09:32:33,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 284 transitions, 619 flow [2025-02-06 09:32:33,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:33,886 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 571 flow [2025-02-06 09:32:33,886 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-02-06 09:32:33,887 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2025-02-06 09:32:33,887 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 571 flow [2025-02-06 09:32:33,889 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-02-06 09:32:33,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:33,889 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-02-06 09:32:33,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:32:33,889 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-02-06 09:32:33,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1761227139, now seen corresponding path program 1 times [2025-02-06 09:32:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:33,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042037699] [2025-02-06 09:32:33,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:33,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:33,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 09:32:33,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 09:32:33,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:33,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:33,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:33,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042037699] [2025-02-06 09:32:33,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042037699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:33,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:33,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:33,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434202644] [2025-02-06 09:32:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:33,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:33,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:33,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:33,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 341 [2025-02-06 09:32:33,979 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-02-06 09:32:33,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:33,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 341 [2025-02-06 09:32:33,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:34,107 INFO L124 PetriNetUnfolderBase]: 76/765 cut-off events. [2025-02-06 09:32:34,107 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 09:32:34,112 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 3517 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-02-06 09:32:34,115 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 19 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-02-06 09:32:34,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 287 transitions, 634 flow [2025-02-06 09:32:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2025-02-06 09:32:34,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9159335288367546 [2025-02-06 09:32:34,119 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 571 flow. Second operand 3 states and 937 transitions. [2025-02-06 09:32:34,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 287 transitions, 634 flow [2025-02-06 09:32:34,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 287 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:34,125 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 577 flow [2025-02-06 09:32:34,126 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-02-06 09:32:34,126 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2025-02-06 09:32:34,126 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 577 flow [2025-02-06 09:32:34,127 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-02-06 09:32:34,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:34,128 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-02-06 09:32:34,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:32:34,128 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-02-06 09:32:34,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:34,129 INFO L85 PathProgramCache]: Analyzing trace with hash 23314304, now seen corresponding path program 1 times [2025-02-06 09:32:34,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:34,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607142228] [2025-02-06 09:32:34,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:34,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 09:32:34,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 09:32:34,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:34,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:34,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607142228] [2025-02-06 09:32:34,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607142228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:34,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:34,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:32:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669127815] [2025-02-06 09:32:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:34,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:32:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:34,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:32:34,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:32:34,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 341 [2025-02-06 09:32:34,745 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-02-06 09:32:34,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:34,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 341 [2025-02-06 09:32:34,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:35,225 INFO L124 PetriNetUnfolderBase]: 202/1252 cut-off events. [2025-02-06 09:32:35,225 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-02-06 09:32:35,229 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 5665 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-02-06 09:32:35,235 INFO L140 encePairwiseOnDemand]: 312/341 looper letters, 52 selfloop transitions, 42 changer transitions 0/331 dead transitions. [2025-02-06 09:32:35,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 331 transitions, 885 flow [2025-02-06 09:32:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:32:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:32:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2852 transitions. [2025-02-06 09:32:35,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2025-02-06 09:32:35,243 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 577 flow. Second operand 10 states and 2852 transitions. [2025-02-06 09:32:35,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 331 transitions, 885 flow [2025-02-06 09:32:35,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 331 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:32:35,251 INFO L231 Difference]: Finished difference. Result has 292 places, 305 transitions, 769 flow [2025-02-06 09:32:35,252 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-02-06 09:32:35,253 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2025-02-06 09:32:35,253 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 305 transitions, 769 flow [2025-02-06 09:32:35,255 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-02-06 09:32:35,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:35,255 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-02-06 09:32:35,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:32:35,256 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-02-06 09:32:35,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1674449826, now seen corresponding path program 1 times [2025-02-06 09:32:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:35,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-02-06 09:32:35,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:35,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:35,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 09:32:35,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 09:32:35,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:35,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:35,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:35,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-02-06 09:32:35,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935448622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:35,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:35,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:35,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144162236] [2025-02-06 09:32:35,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:35,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:35,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:35,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:35,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:35,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 341 [2025-02-06 09:32:35,331 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-02-06 09:32:35,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:35,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 341 [2025-02-06 09:32:35,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:35,462 INFO L124 PetriNetUnfolderBase]: 90/783 cut-off events. [2025-02-06 09:32:35,462 INFO L125 PetriNetUnfolderBase]: For 77/80 co-relation queries the response was YES. [2025-02-06 09:32:35,464 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-02-06 09:32:35,467 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 11 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2025-02-06 09:32:35,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 304 transitions, 791 flow [2025-02-06 09:32:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-02-06 09:32:35,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-02-06 09:32:35,469 INFO L175 Difference]: Start difference. First operand has 292 places, 305 transitions, 769 flow. Second operand 3 states and 930 transitions. [2025-02-06 09:32:35,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 304 transitions, 791 flow [2025-02-06 09:32:35,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 304 transitions, 791 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:32:35,477 INFO L231 Difference]: Finished difference. Result has 293 places, 304 transitions, 769 flow [2025-02-06 09:32:35,478 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-02-06 09:32:35,479 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2025-02-06 09:32:35,479 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 304 transitions, 769 flow [2025-02-06 09:32:35,480 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-02-06 09:32:35,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:35,480 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-02-06 09:32:35,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:32:35,480 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-02-06 09:32:35,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1189261552, now seen corresponding path program 1 times [2025-02-06 09:32:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:35,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530993365] [2025-02-06 09:32:35,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:35,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:35,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-06 09:32:35,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-06 09:32:35,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:35,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530993365] [2025-02-06 09:32:35,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530993365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:35,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626695532] [2025-02-06 09:32:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:35,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:35,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:35,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:35,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:35,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-02-06 09:32:35,552 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-02-06 09:32:35,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:35,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-02-06 09:32:35,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:35,732 INFO L124 PetriNetUnfolderBase]: 136/970 cut-off events. [2025-02-06 09:32:35,732 INFO L125 PetriNetUnfolderBase]: For 98/99 co-relation queries the response was YES. [2025-02-06 09:32:35,736 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 3901 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-02-06 09:32:35,739 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 15 selfloop transitions, 2 changer transitions 28/307 dead transitions. [2025-02-06 09:32:35,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 307 transitions, 817 flow [2025-02-06 09:32:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-02-06 09:32:35,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9051808406647116 [2025-02-06 09:32:35,742 INFO L175 Difference]: Start difference. First operand has 293 places, 304 transitions, 769 flow. Second operand 3 states and 926 transitions. [2025-02-06 09:32:35,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 307 transitions, 817 flow [2025-02-06 09:32:35,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:35,750 INFO L231 Difference]: Finished difference. Result has 292 places, 274 transitions, 644 flow [2025-02-06 09:32:35,751 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-02-06 09:32:35,752 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2025-02-06 09:32:35,752 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 274 transitions, 644 flow [2025-02-06 09:32:35,753 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-02-06 09:32:35,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:35,753 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-02-06 09:32:35,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:32:35,753 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-02-06 09:32:35,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash -665219497, now seen corresponding path program 1 times [2025-02-06 09:32:35,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:35,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562010471] [2025-02-06 09:32:35,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:35,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 09:32:35,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 09:32:35,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:32:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:36,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562010471] [2025-02-06 09:32:36,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562010471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:36,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:32:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911373916] [2025-02-06 09:32:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:36,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:32:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:36,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:32:36,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:32:36,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 341 [2025-02-06 09:32:36,514 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-02-06 09:32:36,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:36,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 341 [2025-02-06 09:32:36,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:37,143 INFO L124 PetriNetUnfolderBase]: 231/1287 cut-off events. [2025-02-06 09:32:37,144 INFO L125 PetriNetUnfolderBase]: For 159/166 co-relation queries the response was YES. [2025-02-06 09:32:37,149 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 7356 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-02-06 09:32:37,154 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 47 selfloop transitions, 10 changer transitions 0/299 dead transitions. [2025-02-06 09:32:37,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 299 transitions, 824 flow [2025-02-06 09:32:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:32:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:32:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2025-02-06 09:32:37,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8665689149560117 [2025-02-06 09:32:37,159 INFO L175 Difference]: Start difference. First operand has 292 places, 274 transitions, 644 flow. Second operand 6 states and 1773 transitions. [2025-02-06 09:32:37,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 299 transitions, 824 flow [2025-02-06 09:32:37,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 299 transitions, 768 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-02-06 09:32:37,167 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 668 flow [2025-02-06 09:32:37,167 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-02-06 09:32:37,169 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2025-02-06 09:32:37,169 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 668 flow [2025-02-06 09:32:37,170 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-02-06 09:32:37,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:37,171 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-02-06 09:32:37,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:32:37,171 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-02-06 09:32:37,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -618590951, now seen corresponding path program 1 times [2025-02-06 09:32:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:37,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839612250] [2025-02-06 09:32:37,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:37,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 09:32:37,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 09:32:37,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:37,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:32:37,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:37,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839612250] [2025-02-06 09:32:37,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839612250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:37,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:37,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:37,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164213666] [2025-02-06 09:32:37,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:37,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:37,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:37,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:37,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:37,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-02-06 09:32:37,274 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-02-06 09:32:37,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:37,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-02-06 09:32:37,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:37,535 INFO L124 PetriNetUnfolderBase]: 283/1423 cut-off events. [2025-02-06 09:32:37,535 INFO L125 PetriNetUnfolderBase]: For 823/835 co-relation queries the response was YES. [2025-02-06 09:32:37,544 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 8226 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-02-06 09:32:37,552 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 22 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-02-06 09:32:37,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 288 transitions, 738 flow [2025-02-06 09:32:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-02-06 09:32:37,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042033235581622 [2025-02-06 09:32:37,555 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 668 flow. Second operand 3 states and 925 transitions. [2025-02-06 09:32:37,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 288 transitions, 738 flow [2025-02-06 09:32:37,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 288 transitions, 728 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-02-06 09:32:37,562 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 662 flow [2025-02-06 09:32:37,563 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-02-06 09:32:37,563 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-02-06 09:32:37,563 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 662 flow [2025-02-06 09:32:37,564 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-02-06 09:32:37,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:37,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:37,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:32:37,565 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-02-06 09:32:37,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1727169092, now seen corresponding path program 1 times [2025-02-06 09:32:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:37,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928421416] [2025-02-06 09:32:37,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:37,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-06 09:32:37,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-06 09:32:37,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:37,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:32:37,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:37,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928421416] [2025-02-06 09:32:37,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928421416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:37,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:37,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:37,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275558274] [2025-02-06 09:32:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:37,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:37,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:37,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:37,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:37,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 341 [2025-02-06 09:32:37,659 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-02-06 09:32:37,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:37,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 341 [2025-02-06 09:32:37,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:37,931 INFO L124 PetriNetUnfolderBase]: 194/1198 cut-off events. [2025-02-06 09:32:37,932 INFO L125 PetriNetUnfolderBase]: For 421/431 co-relation queries the response was YES. [2025-02-06 09:32:37,938 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 6443 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-02-06 09:32:37,943 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 21 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2025-02-06 09:32:37,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 293 transitions, 764 flow [2025-02-06 09:32:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2025-02-06 09:32:37,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139784946236559 [2025-02-06 09:32:37,946 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 662 flow. Second operand 3 states and 935 transitions. [2025-02-06 09:32:37,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 293 transitions, 764 flow [2025-02-06 09:32:37,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:37,952 INFO L231 Difference]: Finished difference. Result has 283 places, 287 transitions, 721 flow [2025-02-06 09:32:37,952 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-02-06 09:32:37,953 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-02-06 09:32:37,953 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 287 transitions, 721 flow [2025-02-06 09:32:37,954 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-02-06 09:32:37,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:37,954 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-02-06 09:32:37,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:32:37,954 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-02-06 09:32:37,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1273136677, now seen corresponding path program 1 times [2025-02-06 09:32:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:37,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302456934] [2025-02-06 09:32:37,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:37,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 09:32:38,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 09:32:38,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:38,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:32:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:39,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302456934] [2025-02-06 09:32:39,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302456934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:39,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:39,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-06 09:32:39,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619906080] [2025-02-06 09:32:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:39,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 09:32:39,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:39,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 09:32:39,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-02-06 09:32:42,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 341 [2025-02-06 09:32:42,767 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-02-06 09:32:42,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:42,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 341 [2025-02-06 09:32:42,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:45,185 INFO L124 PetriNetUnfolderBase]: 1226/4757 cut-off events. [2025-02-06 09:32:45,185 INFO L125 PetriNetUnfolderBase]: For 2170/2283 co-relation queries the response was YES. [2025-02-06 09:32:45,209 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 39890 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-02-06 09:32:45,231 INFO L140 encePairwiseOnDemand]: 306/341 looper letters, 105 selfloop transitions, 53 changer transitions 4/369 dead transitions. [2025-02-06 09:32:45,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 369 transitions, 1430 flow [2025-02-06 09:32:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 09:32:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-02-06 09:32:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8436 transitions. [2025-02-06 09:32:45,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7496667555318581 [2025-02-06 09:32:45,250 INFO L175 Difference]: Start difference. First operand has 283 places, 287 transitions, 721 flow. Second operand 33 states and 8436 transitions. [2025-02-06 09:32:45,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 369 transitions, 1430 flow [2025-02-06 09:32:45,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 369 transitions, 1430 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:32:45,259 INFO L231 Difference]: Finished difference. Result has 320 places, 308 transitions, 1023 flow [2025-02-06 09:32:45,260 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-02-06 09:32:45,261 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 5 predicate places. [2025-02-06 09:32:45,261 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 308 transitions, 1023 flow [2025-02-06 09:32:45,263 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-02-06 09:32:45,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:45,264 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-02-06 09:32:45,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:32:45,264 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-02-06 09:32:45,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1923154053, now seen corresponding path program 2 times [2025-02-06 09:32:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912914822] [2025-02-06 09:32:45,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:32:45,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:45,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-02-06 09:32:45,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 160 of 202 statements. [2025-02-06 09:32:45,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:32:45,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:32:46,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:46,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912914822] [2025-02-06 09:32:46,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912914822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:46,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:46,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-06 09:32:46,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776191882] [2025-02-06 09:32:46,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:46,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 09:32:46,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:46,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 09:32:46,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-02-06 09:32:48,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 341 [2025-02-06 09:32:48,323 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-02-06 09:32:48,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:48,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 341 [2025-02-06 09:32:48,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:50,472 INFO L124 PetriNetUnfolderBase]: 1245/5462 cut-off events. [2025-02-06 09:32:50,472 INFO L125 PetriNetUnfolderBase]: For 5364/5513 co-relation queries the response was YES. [2025-02-06 09:32:50,498 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 48866 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-02-06 09:32:50,519 INFO L140 encePairwiseOnDemand]: 306/341 looper letters, 84 selfloop transitions, 74 changer transitions 0/369 dead transitions. [2025-02-06 09:32:50,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 369 transitions, 1707 flow [2025-02-06 09:32:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 09:32:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-02-06 09:32:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8488 transitions. [2025-02-06 09:32:50,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542877454900915 [2025-02-06 09:32:50,537 INFO L175 Difference]: Start difference. First operand has 320 places, 308 transitions, 1023 flow. Second operand 33 states and 8488 transitions. [2025-02-06 09:32:50,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 369 transitions, 1707 flow [2025-02-06 09:32:50,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 369 transitions, 1656 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-02-06 09:32:50,555 INFO L231 Difference]: Finished difference. Result has 327 places, 336 transitions, 1421 flow [2025-02-06 09:32:50,556 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-02-06 09:32:50,557 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 12 predicate places. [2025-02-06 09:32:50,557 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 336 transitions, 1421 flow [2025-02-06 09:32:50,559 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-02-06 09:32:50,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:50,559 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-02-06 09:32:50,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:32:50,559 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-02-06 09:32:50,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1399264513, now seen corresponding path program 1 times [2025-02-06 09:32:50,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:50,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391765712] [2025-02-06 09:32:50,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:50,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:50,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 09:32:50,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 09:32:50,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:50,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:32:51,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391765712] [2025-02-06 09:32:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391765712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:32:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201612818] [2025-02-06 09:32:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:51,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:32:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:51,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:32:51,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:32:51,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 341 [2025-02-06 09:32:51,269 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-02-06 09:32:51,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:51,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 341 [2025-02-06 09:32:51,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:52,615 INFO L124 PetriNetUnfolderBase]: 1531/6031 cut-off events. [2025-02-06 09:32:52,615 INFO L125 PetriNetUnfolderBase]: For 10376/10511 co-relation queries the response was YES. [2025-02-06 09:32:52,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13857 conditions, 6031 events. 1531/6031 cut-off events. For 10376/10511 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 54133 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-02-06 09:32:52,680 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 74 selfloop transitions, 23 changer transitions 0/369 dead transitions. [2025-02-06 09:32:52,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 369 transitions, 1783 flow [2025-02-06 09:32:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:32:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:32:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1771 transitions. [2025-02-06 09:32:52,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655913978494624 [2025-02-06 09:32:52,683 INFO L175 Difference]: Start difference. First operand has 327 places, 336 transitions, 1421 flow. Second operand 6 states and 1771 transitions. [2025-02-06 09:32:52,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 369 transitions, 1783 flow [2025-02-06 09:32:52,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 369 transitions, 1700 flow, removed 16 selfloop flow, removed 26 redundant places. [2025-02-06 09:32:52,716 INFO L231 Difference]: Finished difference. Result has 311 places, 353 transitions, 1582 flow [2025-02-06 09:32:52,716 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-02-06 09:32:52,717 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -4 predicate places. [2025-02-06 09:32:52,718 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 353 transitions, 1582 flow [2025-02-06 09:32:52,718 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-02-06 09:32:52,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:52,719 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-02-06 09:32:52,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:32:52,719 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-02-06 09:32:52,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash -598934692, now seen corresponding path program 1 times [2025-02-06 09:32:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713150930] [2025-02-06 09:32:52,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:52,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:52,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 09:32:52,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 09:32:52,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:52,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 09:32:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713150930] [2025-02-06 09:32:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713150930] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:32:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962912834] [2025-02-06 09:32:53,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:53,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:32:53,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:32:53,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:32:53,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:32:53,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 09:32:53,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 09:32:53,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:53,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:53,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 09:32:53,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:32:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 09:32:53,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:32:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 09:32:54,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962912834] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:32:54,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:32:54,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-02-06 09:32:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683914700] [2025-02-06 09:32:54,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:32:54,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 09:32:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:54,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 09:32:54,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-02-06 09:32:55,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 341 [2025-02-06 09:32:55,178 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-02-06 09:32:55,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:55,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 341 [2025-02-06 09:32:55,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:57,318 INFO L124 PetriNetUnfolderBase]: 2977/10478 cut-off events. [2025-02-06 09:32:57,318 INFO L125 PetriNetUnfolderBase]: For 22181/23553 co-relation queries the response was YES. [2025-02-06 09:32:57,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25992 conditions, 10478 events. 2977/10478 cut-off events. For 22181/23553 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 101536 event pairs, 1131 based on Foata normal form. 472/10361 useless extension candidates. Maximal degree in co-relation 25936. Up to 2706 conditions per place. [2025-02-06 09:32:57,409 INFO L140 encePairwiseOnDemand]: 299/341 looper letters, 137 selfloop transitions, 95 changer transitions 0/488 dead transitions. [2025-02-06 09:32:57,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 488 transitions, 2696 flow [2025-02-06 09:32:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 09:32:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-06 09:32:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6226 transitions. [2025-02-06 09:32:57,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7938288920056101 [2025-02-06 09:32:57,414 INFO L175 Difference]: Start difference. First operand has 311 places, 353 transitions, 1582 flow. Second operand 23 states and 6226 transitions. [2025-02-06 09:32:57,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 488 transitions, 2696 flow [2025-02-06 09:32:57,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 488 transitions, 2664 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-02-06 09:32:57,478 INFO L231 Difference]: Finished difference. Result has 346 places, 417 transitions, 2199 flow [2025-02-06 09:32:57,480 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-02-06 09:32:57,481 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 31 predicate places. [2025-02-06 09:32:57,481 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 417 transitions, 2199 flow [2025-02-06 09:32:57,484 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-02-06 09:32:57,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:57,489 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-02-06 09:32:57,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:32:57,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 09:32:57,690 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-02-06 09:32:57,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:57,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1852097855, now seen corresponding path program 1 times [2025-02-06 09:32:57,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:57,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943625680] [2025-02-06 09:32:57,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:57,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-06 09:32:57,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-06 09:32:57,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:57,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 09:32:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943625680] [2025-02-06 09:32:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943625680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:57,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:57,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232500214] [2025-02-06 09:32:57,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:57,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:57,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:57,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:57,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-02-06 09:32:57,774 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-02-06 09:32:57,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:57,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-02-06 09:32:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:59,776 INFO L124 PetriNetUnfolderBase]: 2446/10380 cut-off events. [2025-02-06 09:32:59,777 INFO L125 PetriNetUnfolderBase]: For 20333/20698 co-relation queries the response was YES. [2025-02-06 09:32:59,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26107 conditions, 10380 events. 2446/10380 cut-off events. For 20333/20698 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 102744 event pairs, 841 based on Foata normal form. 59/9983 useless extension candidates. Maximal degree in co-relation 26036. Up to 2061 conditions per place. [2025-02-06 09:32:59,880 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 42 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-02-06 09:32:59,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 423 transitions, 2323 flow [2025-02-06 09:32:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-02-06 09:32:59,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022482893450635 [2025-02-06 09:32:59,882 INFO L175 Difference]: Start difference. First operand has 346 places, 417 transitions, 2199 flow. Second operand 3 states and 923 transitions. [2025-02-06 09:32:59,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 423 transitions, 2323 flow [2025-02-06 09:32:59,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 423 transitions, 2291 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:59,956 INFO L231 Difference]: Finished difference. Result has 346 places, 416 transitions, 2169 flow [2025-02-06 09:32:59,956 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-02-06 09:32:59,957 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 31 predicate places. [2025-02-06 09:32:59,957 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 416 transitions, 2169 flow [2025-02-06 09:32:59,958 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-02-06 09:32:59,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:59,958 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-02-06 09:32:59,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:32:59,959 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-02-06 09:32:59,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash -359876861, now seen corresponding path program 1 times [2025-02-06 09:32:59,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:59,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494471966] [2025-02-06 09:32:59,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:59,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-06 09:33:00,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-06 09:33:00,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:00,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:33:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494471966] [2025-02-06 09:33:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494471966] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:33:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862064910] [2025-02-06 09:33:00,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:33:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:33:00,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:33:00,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:33:01,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-06 09:33:01,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-06 09:33:01,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:01,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:01,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 09:33:01,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:33:01,187 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-02-06 09:33:01,275 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:33:01,275 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-02-06 09:33:01,564 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-02-06 09:33:01,573 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-02-06 09:33:01,581 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-02-06 09:33:01,629 INFO L349 Elim1Store]: treesize reduction 458, result has 0.2 percent of original size [2025-02-06 09:33:01,629 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-02-06 09:33:01,638 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-02-06 09:33:01,652 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-02-06 09:33:01,666 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-02-06 09:33:01,679 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-02-06 09:33:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:33:01,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:33:01,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:33:01,756 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-02-06 09:33:01,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:33:01,770 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-02-06 09:33:01,780 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-02-06 09:33:01,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:33:01,799 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-02-06 09:33:01,804 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-02-06 09:33:01,815 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:33:01,822 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:33:01,822 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-02-06 09:33:01,826 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:33:01,831 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:33:01,831 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-02-06 09:33:01,835 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:33:01,843 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:33:01,843 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-02-06 09:33:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:33:02,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862064910] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:33:02,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:33:02,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-02-06 09:33:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565017852] [2025-02-06 09:33:02,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:33:02,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 09:33:02,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:02,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 09:33:02,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-02-06 09:33:03,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 341 [2025-02-06 09:33:03,938 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-02-06 09:33:03,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:03,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 341 [2025-02-06 09:33:03,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:05,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] 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)), 209#L78-2true, 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|))), 244#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|))), 151#L51-6true, Black: 361#true, 363#(= |#race~A~0| 0), 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|))), 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-02-06 09:33:05,292 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is not cut-off event [2025-02-06 09:33:05,292 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-02-06 09:33:05,292 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-02-06 09:33:05,292 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is not cut-off event [2025-02-06 09:33:06,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] 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)), 209#L78-2true, 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|))), 244#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|))), 151#L51-6true, Black: 361#true, 363#(= |#race~A~0| 0), 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|))), 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-02-06 09:33:06,479 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is not cut-off event [2025-02-06 09:33:06,479 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is not cut-off event [2025-02-06 09:33:06,479 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is not cut-off event [2025-02-06 09:33:06,479 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is not cut-off event [2025-02-06 09:33:06,905 INFO L124 PetriNetUnfolderBase]: 3396/12612 cut-off events. [2025-02-06 09:33:06,905 INFO L125 PetriNetUnfolderBase]: For 30585/31643 co-relation queries the response was YES. [2025-02-06 09:33:07,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31889 conditions, 12612 events. 3396/12612 cut-off events. For 30585/31643 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 124873 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-02-06 09:33:07,054 INFO L140 encePairwiseOnDemand]: 309/341 looper letters, 151 selfloop transitions, 83 changer transitions 0/507 dead transitions. [2025-02-06 09:33:07,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 507 transitions, 3307 flow [2025-02-06 09:33:07,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 09:33:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-02-06 09:33:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6554 transitions. [2025-02-06 09:33:07,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7687976539589443 [2025-02-06 09:33:07,060 INFO L175 Difference]: Start difference. First operand has 346 places, 416 transitions, 2169 flow. Second operand 25 states and 6554 transitions. [2025-02-06 09:33:07,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 507 transitions, 3307 flow [2025-02-06 09:33:07,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 507 transitions, 3303 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:07,150 INFO L231 Difference]: Finished difference. Result has 373 places, 432 transitions, 2600 flow [2025-02-06 09:33:07,151 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-02-06 09:33:07,151 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 58 predicate places. [2025-02-06 09:33:07,151 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 432 transitions, 2600 flow [2025-02-06 09:33:07,152 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-02-06 09:33:07,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:07,153 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-02-06 09:33:07,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:33:07,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:33:07,357 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-02-06 09:33:07,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:07,358 INFO L85 PathProgramCache]: Analyzing trace with hash -657447165, now seen corresponding path program 2 times [2025-02-06 09:33:07,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:07,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647159618] [2025-02-06 09:33:07,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:33:07,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:07,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-02-06 09:33:07,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-02-06 09:33:07,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:33:07,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:33:08,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:08,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647159618] [2025-02-06 09:33:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647159618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:33:08,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182813050] [2025-02-06 09:33:08,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:33:08,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:33:08,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:33:08,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:33:08,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:33:08,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-02-06 09:33:08,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-02-06 09:33:08,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:33:08,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:08,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 09:33:08,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:33:08,816 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-02-06 09:33:08,969 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:33:08,969 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-02-06 09:33:09,326 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-02-06 09:33:09,340 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-02-06 09:33:09,382 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-02-06 09:33:09,387 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-02-06 09:33:09,392 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-02-06 09:33:09,430 INFO L349 Elim1Store]: treesize reduction 458, result has 0.2 percent of original size [2025-02-06 09:33:09,430 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-02-06 09:33:09,434 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-02-06 09:33:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:33:09,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:33:09,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:33:09,569 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-02-06 09:33:09,574 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-02-06 09:33:09,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:33:09,583 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-02-06 09:33:09,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:33:09,592 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-02-06 09:33:09,596 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-02-06 09:33:09,602 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:33:09,607 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:33:09,607 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-02-06 09:33:09,610 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:33:09,614 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:33:09,615 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-02-06 09:33:09,617 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:33:09,622 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:33:09,622 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-02-06 09:33:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:33:09,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182813050] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:33:09,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:33:09,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 38 [2025-02-06 09:33:09,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675067575] [2025-02-06 09:33:09,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:33:09,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-06 09:33:09,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:09,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-06 09:33:09,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 09:33:14,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 341 [2025-02-06 09:33:14,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 432 transitions, 2600 flow. Second operand has 39 states, 39 states have (on average 207.92307692307693) internal successors, (8109), 39 states have internal predecessors, (8109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:33:14,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:14,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 341 [2025-02-06 09:33:14,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:19,566 INFO L124 PetriNetUnfolderBase]: 3772/14991 cut-off events. [2025-02-06 09:33:19,566 INFO L125 PetriNetUnfolderBase]: For 52837/54245 co-relation queries the response was YES. [2025-02-06 09:33:19,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42617 conditions, 14991 events. 3772/14991 cut-off events. For 52837/54245 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 155822 event pairs, 929 based on Foata normal form. 717/15486 useless extension candidates. Maximal degree in co-relation 42535. Up to 2639 conditions per place. [2025-02-06 09:33:19,790 INFO L140 encePairwiseOnDemand]: 288/341 looper letters, 153 selfloop transitions, 148 changer transitions 0/524 dead transitions. [2025-02-06 09:33:19,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 524 transitions, 3929 flow [2025-02-06 09:33:19,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-06 09:33:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-02-06 09:33:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 7673 transitions. [2025-02-06 09:33:19,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081477371799953 [2025-02-06 09:33:19,797 INFO L175 Difference]: Start difference. First operand has 373 places, 432 transitions, 2600 flow. Second operand 37 states and 7673 transitions. [2025-02-06 09:33:19,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 524 transitions, 3929 flow [2025-02-06 09:33:19,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 524 transitions, 3866 flow, removed 1 selfloop flow, removed 19 redundant places. [2025-02-06 09:33:19,966 INFO L231 Difference]: Finished difference. Result has 394 places, 458 transitions, 3264 flow [2025-02-06 09:33:19,968 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-02-06 09:33:19,968 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 79 predicate places. [2025-02-06 09:33:19,968 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 458 transitions, 3264 flow [2025-02-06 09:33:19,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 207.92307692307693) internal successors, (8109), 39 states have internal predecessors, (8109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:33:19,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:19,970 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-02-06 09:33:19,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 09:33:20,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:33:20,171 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-02-06 09:33:20,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1000187421, now seen corresponding path program 1 times [2025-02-06 09:33:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:20,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756354410] [2025-02-06 09:33:20,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:20,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:20,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 09:33:20,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 09:33:20,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:20,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 09:33:20,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:20,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756354410] [2025-02-06 09:33:20,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756354410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:33:20,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912617698] [2025-02-06 09:33:20,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:20,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:33:20,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:33:20,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:33:20,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:33:20,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 09:33:20,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 09:33:20,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:20,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:20,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 09:33:20,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:33:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 09:33:21,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:33:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 09:33:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912617698] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:33:21,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:33:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-02-06 09:33:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031913992] [2025-02-06 09:33:21,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:33:21,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 09:33:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:21,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 09:33:21,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-02-06 09:33:22,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 341 [2025-02-06 09:33:22,623 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-02-06 09:33:22,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:22,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 341 [2025-02-06 09:33:22,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:25,296 INFO L124 PetriNetUnfolderBase]: 2298/10935 cut-off events. [2025-02-06 09:33:25,296 INFO L125 PetriNetUnfolderBase]: For 43754/43915 co-relation queries the response was YES. [2025-02-06 09:33:25,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32232 conditions, 10935 events. 2298/10935 cut-off events. For 43754/43915 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 107545 event pairs, 621 based on Foata normal form. 87/10682 useless extension candidates. Maximal degree in co-relation 32149. Up to 1662 conditions per place. [2025-02-06 09:33:25,443 INFO L140 encePairwiseOnDemand]: 299/341 looper letters, 97 selfloop transitions, 44 changer transitions 156/567 dead transitions. [2025-02-06 09:33:25,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 567 transitions, 4864 flow [2025-02-06 09:33:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 09:33:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-06 09:33:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6238 transitions. [2025-02-06 09:33:25,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953589187810787 [2025-02-06 09:33:25,448 INFO L175 Difference]: Start difference. First operand has 394 places, 458 transitions, 3264 flow. Second operand 23 states and 6238 transitions. [2025-02-06 09:33:25,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 567 transitions, 4864 flow [2025-02-06 09:33:25,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 567 transitions, 4713 flow, removed 22 selfloop flow, removed 29 redundant places. [2025-02-06 09:33:25,585 INFO L231 Difference]: Finished difference. Result has 392 places, 398 transitions, 2651 flow [2025-02-06 09:33:25,586 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-02-06 09:33:25,586 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 77 predicate places. [2025-02-06 09:33:25,586 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 398 transitions, 2651 flow [2025-02-06 09:33:25,588 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-02-06 09:33:25,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:25,589 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-02-06 09:33:25,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 09:33:25,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-06 09:33:25,789 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-02-06 09:33:25,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1943138373, now seen corresponding path program 2 times [2025-02-06 09:33:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:25,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696086559] [2025-02-06 09:33:25,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:33:25,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:25,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-02-06 09:33:25,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-02-06 09:33:25,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:33:25,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 09:33:27,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:27,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696086559] [2025-02-06 09:33:27,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696086559] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:33:27,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266523833] [2025-02-06 09:33:27,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:33:27,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:33:27,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:33:27,976 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:33:27,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 09:33:28,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-02-06 09:33:28,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-02-06 09:33:28,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:33:28,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:28,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-06 09:33:28,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:33:28,572 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-02-06 09:33:28,880 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 09:33:28,880 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-02-06 09:33:29,294 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:33:29,294 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-02-06 09:33:29,921 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-02-06 09:33:30,003 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-02-06 09:33:30,075 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-02-06 09:33:30,143 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-02-06 09:33:30,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:33:30,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:33:30,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:33:30,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:33:30,226 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-02-06 09:33:30,234 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-02-06 09:33:30,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:33:30,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:33:30,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:33:30,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:33:30,272 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-02-06 09:33:30,279 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-02-06 09:33:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 09:33:34,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:33:35,408 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2025-02-06 09:33:35,408 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-02-06 09:33:35,418 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-02-06 09:33:35,419 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-02-06 09:33:35,428 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-02-06 09:33:35,434 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-02-06 09:33:35,454 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2025-02-06 09:33:35,454 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-02-06 09:33:35,473 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2025-02-06 09:33:35,474 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-02-06 09:33:35,489 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2025-02-06 09:33:35,490 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-02-06 09:33:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 09:33:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266523833] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:33:37,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:33:37,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 21] total 75 [2025-02-06 09:33:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162578347] [2025-02-06 09:33:37,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:33:37,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-02-06 09:33:37,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:37,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-02-06 09:33:37,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=5226, Unknown=138, NotChecked=0, Total=5700