./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 f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:26:27,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:26:27,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:26:27,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:26:27,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:26:27,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:26:27,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:26:27,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:26:27,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:26:27,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:26:27,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:26:27,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:26:27,662 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:26:27,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:26:27,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:26:27,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:26:27,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:26:27,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:26:27,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:26:27,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:27,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:26:27,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:26:27,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:26:27,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:26:27,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:26:27,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:26:27,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:26:27,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:26:27,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:26:27,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:26:27,665 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2025-03-13 22:26:27,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:26:27,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:26:27,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:26:27,960 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:26:27,961 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:26:27,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-13 22:26:29,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0a93d54/a8471e155b8f4cd4ae440a2f1af232ad/FLAGed78dd2e0 [2025-03-13 22:26:29,383 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:26:29,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-13 22:26:29,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0a93d54/a8471e155b8f4cd4ae440a2f1af232ad/FLAGed78dd2e0 [2025-03-13 22:26:29,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0a93d54/a8471e155b8f4cd4ae440a2f1af232ad [2025-03-13 22:26:29,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:26:29,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:26:29,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:29,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:26:29,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:26:29,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560e4c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29, skipping insertion in model container [2025-03-13 22:26:29,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:26:29,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:29,885 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:26:29,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:29,921 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:26:29,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29 WrapperNode [2025-03-13 22:26:29,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:29,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:29,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:26:29,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:26:29,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,953 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 180 [2025-03-13 22:26:29,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:29,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:26:29,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:26:29,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:26:29,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:26:29,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:26:29,980 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:26:29,980 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:26:29,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:30,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:26:30,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:26:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:26:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:26:30,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:26:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:26:30,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:26:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:26:30,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:26:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:26:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:26:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:26:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:26:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:26:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:26:30,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:26:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:26:30,035 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:26:30,132 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:26:30,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:26:30,565 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:26:30,566 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:26:30,566 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:26:30,697 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:26:30,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:30 BoogieIcfgContainer [2025-03-13 22:26:30,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:26:30,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:26:30,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:26:30,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:26:30,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:26:29" (1/3) ... [2025-03-13 22:26:30,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df2ecf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:30, skipping insertion in model container [2025-03-13 22:26:30,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (2/3) ... [2025-03-13 22:26:30,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df2ecf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:30, skipping insertion in model container [2025-03-13 22:26:30,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:30" (3/3) ... [2025-03-13 22:26:30,704 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-03-13 22:26:30,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:26:30,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 325 locations, 1 initial locations, 6 loop locations, and 36 error locations. [2025-03-13 22:26:30,716 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:26:30,791 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:26:30,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 341 transitions, 703 flow [2025-03-13 22:26:30,924 INFO L124 PetriNetUnfolderBase]: 17/338 cut-off events. [2025-03-13 22:26:30,925 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:26:30,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 338 events. 17/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 471 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 288. Up to 2 conditions per place. [2025-03-13 22:26:30,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 341 transitions, 703 flow [2025-03-13 22:26:30,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 321 transitions, 660 flow [2025-03-13 22:26:30,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:26:30,962 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;@536da8ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:26:30,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-13 22:26:30,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:26:30,967 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-13 22:26:30,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:26:30,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:30,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:30,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:30,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -627594817, now seen corresponding path program 1 times [2025-03-13 22:26:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:30,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531302753] [2025-03-13 22:26:30,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:31,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:26:31,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:26:31,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:31,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:31,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:31,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531302753] [2025-03-13 22:26:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531302753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:31,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961311730] [2025-03-13 22:26:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:31,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:31,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:31,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:31,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 341 [2025-03-13 22:26:31,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 321 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:31,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:31,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 341 [2025-03-13 22:26:31,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:31,427 INFO L124 PetriNetUnfolderBase]: 85/884 cut-off events. [2025-03-13 22:26:31,427 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-13 22:26:31,433 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 4510 event pairs, 51 based on Foata normal form. 6/746 useless extension candidates. Maximal degree in co-relation 759. Up to 134 conditions per place. [2025-03-13 22:26:31,438 INFO L140 encePairwiseOnDemand]: 317/341 looper letters, 18 selfloop transitions, 2 changer transitions 6/299 dead transitions. [2025-03-13 22:26:31,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 656 flow [2025-03-13 22:26:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-03-13 22:26:31,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-13 22:26:31,455 INFO L175 Difference]: Start difference. First operand has 315 places, 321 transitions, 660 flow. Second operand 3 states and 930 transitions. [2025-03-13 22:26:31,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 656 flow [2025-03-13 22:26:31,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 299 transitions, 644 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:26:31,464 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 596 flow [2025-03-13 22:26:31,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2025-03-13 22:26:31,471 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -17 predicate places. [2025-03-13 22:26:31,472 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 596 flow [2025-03-13 22:26:31,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:31,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:31,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:31,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:26:31,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 268536786, now seen corresponding path program 1 times [2025-03-13 22:26:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718878245] [2025-03-13 22:26:31,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:31,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:26:31,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:26:31,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:31,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:31,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:31,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718878245] [2025-03-13 22:26:31,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718878245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:31,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:31,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:31,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399010247] [2025-03-13 22:26:31,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:31,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:31,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:31,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:31,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 341 [2025-03-13 22:26:31,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:31,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:31,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 341 [2025-03-13 22:26:31,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:31,734 INFO L124 PetriNetUnfolderBase]: 213/995 cut-off events. [2025-03-13 22:26:31,734 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-13 22:26:31,737 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-03-13 22:26:31,741 INFO L140 encePairwiseOnDemand]: 334/341 looper letters, 21 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2025-03-13 22:26:31,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 287 transitions, 628 flow [2025-03-13 22:26:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-03-13 22:26:31,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778103616813294 [2025-03-13 22:26:31,744 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 596 flow. Second operand 3 states and 898 transitions. [2025-03-13 22:26:31,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 287 transitions, 628 flow [2025-03-13 22:26:31,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 287 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:31,749 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 582 flow [2025-03-13 22:26:31,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=286, PETRI_TRANSITIONS=287} [2025-03-13 22:26:31,750 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -29 predicate places. [2025-03-13 22:26:31,750 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 582 flow [2025-03-13 22:26:31,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:31,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:31,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:31,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:26:31,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:31,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1263638399, now seen corresponding path program 1 times [2025-03-13 22:26:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901182136] [2025-03-13 22:26:31,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:31,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:31,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:26:31,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:26:31,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:31,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:32,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901182136] [2025-03-13 22:26:32,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901182136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:32,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:32,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:32,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74298256] [2025-03-13 22:26:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:32,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:32,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:32,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:32,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 341 [2025-03-13 22:26:32,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 287 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:32,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 341 [2025-03-13 22:26:32,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:32,753 INFO L124 PetriNetUnfolderBase]: 130/889 cut-off events. [2025-03-13 22:26:32,753 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-13 22:26:32,756 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-03-13 22:26:32,759 INFO L140 encePairwiseOnDemand]: 323/341 looper letters, 41 selfloop transitions, 15 changer transitions 0/284 dead transitions. [2025-03-13 22:26:32,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 688 flow [2025-03-13 22:26:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1613 transitions. [2025-03-13 22:26:32,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7883675464320625 [2025-03-13 22:26:32,763 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 582 flow. Second operand 6 states and 1613 transitions. [2025-03-13 22:26:32,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 688 flow [2025-03-13 22:26:32,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:32,767 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 605 flow [2025-03-13 22:26:32,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2025-03-13 22:26:32,768 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -28 predicate places. [2025-03-13 22:26:32,768 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 605 flow [2025-03-13 22:26:32,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:32,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:32,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:26:32,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:32,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2053977778, now seen corresponding path program 1 times [2025-03-13 22:26:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:32,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258919897] [2025-03-13 22:26:32,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:32,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:26:32,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:26:32,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:32,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258919897] [2025-03-13 22:26:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258919897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:32,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:32,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170950631] [2025-03-13 22:26:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:32,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:32,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:32,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:32,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 341 [2025-03-13 22:26:32,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:32,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 341 [2025-03-13 22:26:32,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:32,915 INFO L124 PetriNetUnfolderBase]: 37/389 cut-off events. [2025-03-13 22:26:32,915 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:26:32,918 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-03-13 22:26:32,919 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 13 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-03-13 22:26:32,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 633 flow [2025-03-13 22:26:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-03-13 22:26:32,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983382209188661 [2025-03-13 22:26:32,923 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 605 flow. Second operand 3 states and 919 transitions. [2025-03-13 22:26:32,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 633 flow [2025-03-13 22:26:32,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 283 transitions, 603 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:32,931 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 577 flow [2025-03-13 22:26:32,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2025-03-13 22:26:32,932 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-03-13 22:26:32,932 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 577 flow [2025-03-13 22:26:32,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:32,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:32,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:26:32,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:32,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash 326216764, now seen corresponding path program 1 times [2025-03-13 22:26:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:32,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474780677] [2025-03-13 22:26:32,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:32,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-13 22:26:32,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-13 22:26:32,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:32,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:32,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:32,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474780677] [2025-03-13 22:26:32,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474780677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:32,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984055577] [2025-03-13 22:26:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:32,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:32,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:33,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 341 [2025-03-13 22:26:33,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:33,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 341 [2025-03-13 22:26:33,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:33,084 INFO L124 PetriNetUnfolderBase]: 37/388 cut-off events. [2025-03-13 22:26:33,084 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:26:33,086 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-03-13 22:26:33,087 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-13 22:26:33,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 605 flow [2025-03-13 22:26:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-03-13 22:26:33,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983382209188661 [2025-03-13 22:26:33,089 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 577 flow. Second operand 3 states and 919 transitions. [2025-03-13 22:26:33,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 605 flow [2025-03-13 22:26:33,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 282 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:33,095 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 575 flow [2025-03-13 22:26:33,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2025-03-13 22:26:33,096 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2025-03-13 22:26:33,097 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 575 flow [2025-03-13 22:26:33,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:33,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:33,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:26:33,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:33,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:33,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2012673298, now seen corresponding path program 1 times [2025-03-13 22:26:33,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:33,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562828867] [2025-03-13 22:26:33,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:33,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:33,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-13 22:26:33,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-13 22:26:33,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:33,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:33,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562828867] [2025-03-13 22:26:33,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562828867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:33,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705567247] [2025-03-13 22:26:33,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:33,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:33,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-13 22:26:33,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:33,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-13 22:26:33,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:33,298 INFO L124 PetriNetUnfolderBase]: 21/319 cut-off events. [2025-03-13 22:26:33,299 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:26:33,300 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-03-13 22:26:33,301 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 12 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-13 22:26:33,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 281 transitions, 601 flow [2025-03-13 22:26:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-03-13 22:26:33,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9002932551319648 [2025-03-13 22:26:33,304 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 575 flow. Second operand 3 states and 921 transitions. [2025-03-13 22:26:33,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 281 transitions, 601 flow [2025-03-13 22:26:33,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 281 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:33,310 INFO L231 Difference]: Finished difference. Result has 281 places, 281 transitions, 573 flow [2025-03-13 22:26:33,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=281, PETRI_TRANSITIONS=281} [2025-03-13 22:26:33,311 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -34 predicate places. [2025-03-13 22:26:33,311 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 281 transitions, 573 flow [2025-03-13 22:26:33,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:33,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:33,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:26:33,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1230075292, now seen corresponding path program 1 times [2025-03-13 22:26:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062260839] [2025-03-13 22:26:33,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:33,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-13 22:26:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-13 22:26:33,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:33,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062260839] [2025-03-13 22:26:33,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062260839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:33,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578281212] [2025-03-13 22:26:33,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:33,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:33,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-13 22:26:33,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 281 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:33,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-13 22:26:33,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:33,503 INFO L124 PetriNetUnfolderBase]: 59/519 cut-off events. [2025-03-13 22:26:33,503 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:26:33,505 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-03-13 22:26:33,506 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 16 selfloop transitions, 3 changer transitions 0/284 dead transitions. [2025-03-13 22:26:33,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 284 transitions, 619 flow [2025-03-13 22:26:33,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2025-03-13 22:26:33,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.906158357771261 [2025-03-13 22:26:33,508 INFO L175 Difference]: Start difference. First operand has 281 places, 281 transitions, 573 flow. Second operand 3 states and 927 transitions. [2025-03-13 22:26:33,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 284 transitions, 619 flow [2025-03-13 22:26:33,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:33,511 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 571 flow [2025-03-13 22:26:33,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2025-03-13 22:26:33,512 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2025-03-13 22:26:33,512 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 571 flow [2025-03-13 22:26:33,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:33,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:33,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:26:33,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:33,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash 986375037, now seen corresponding path program 1 times [2025-03-13 22:26:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131687530] [2025-03-13 22:26:33,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:33,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:33,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-13 22:26:33,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-13 22:26:33,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:33,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:33,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131687530] [2025-03-13 22:26:33,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131687530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:33,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498117151] [2025-03-13 22:26:33,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:33,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:33,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:33,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 341 [2025-03-13 22:26:33,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:33,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 341 [2025-03-13 22:26:33,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:33,677 INFO L124 PetriNetUnfolderBase]: 76/765 cut-off events. [2025-03-13 22:26:33,677 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-13 22:26:33,680 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-03-13 22:26:33,683 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 19 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-03-13 22:26:33,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 287 transitions, 634 flow [2025-03-13 22:26:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2025-03-13 22:26:33,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9159335288367546 [2025-03-13 22:26:33,686 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 571 flow. Second operand 3 states and 937 transitions. [2025-03-13 22:26:33,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 287 transitions, 634 flow [2025-03-13 22:26:33,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 287 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:33,695 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 577 flow [2025-03-13 22:26:33,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2025-03-13 22:26:33,696 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2025-03-13 22:26:33,697 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 577 flow [2025-03-13 22:26:33,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:33,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:33,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:26:33,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:33,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash 177659264, now seen corresponding path program 1 times [2025-03-13 22:26:33,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:33,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930670579] [2025-03-13 22:26:33,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:33,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:33,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-13 22:26:33,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-13 22:26:33,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:33,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:33,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930670579] [2025-03-13 22:26:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930670579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:26:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739256626] [2025-03-13 22:26:33,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:26:33,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:26:33,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:26:34,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 341 [2025-03-13 22:26:34,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 577 flow. Second operand has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:34,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 341 [2025-03-13 22:26:34,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:34,558 INFO L124 PetriNetUnfolderBase]: 202/1252 cut-off events. [2025-03-13 22:26:34,558 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-13 22:26:34,561 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-03-13 22:26:34,565 INFO L140 encePairwiseOnDemand]: 312/341 looper letters, 52 selfloop transitions, 42 changer transitions 0/331 dead transitions. [2025-03-13 22:26:34,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 331 transitions, 885 flow [2025-03-13 22:26:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:26:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:26:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2852 transitions. [2025-03-13 22:26:34,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2025-03-13 22:26:34,570 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 577 flow. Second operand 10 states and 2852 transitions. [2025-03-13 22:26:34,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 331 transitions, 885 flow [2025-03-13 22:26:34,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 331 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:34,574 INFO L231 Difference]: Finished difference. Result has 292 places, 305 transitions, 769 flow [2025-03-13 22:26:34,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=769, PETRI_PLACES=292, PETRI_TRANSITIONS=305} [2025-03-13 22:26:34,575 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2025-03-13 22:26:34,575 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 305 transitions, 769 flow [2025-03-13 22:26:34,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:34,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:34,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:26:34,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1916759738, now seen corresponding path program 1 times [2025-03-13 22:26:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:34,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902532847] [2025-03-13 22:26:34,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:34,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-13 22:26:34,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-13 22:26:34,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:34,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:34,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902532847] [2025-03-13 22:26:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902532847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:34,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:34,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739942793] [2025-03-13 22:26:34,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:34,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:34,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:34,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:34,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 341 [2025-03-13 22:26:34,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 305 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:34,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 341 [2025-03-13 22:26:34,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:34,733 INFO L124 PetriNetUnfolderBase]: 90/783 cut-off events. [2025-03-13 22:26:34,733 INFO L125 PetriNetUnfolderBase]: For 77/80 co-relation queries the response was YES. [2025-03-13 22:26:34,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 783 events. 90/783 cut-off events. For 77/80 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2575 event pairs, 32 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 1037. Up to 120 conditions per place. [2025-03-13 22:26:34,738 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 11 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2025-03-13 22:26:34,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 304 transitions, 791 flow [2025-03-13 22:26:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-03-13 22:26:34,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-13 22:26:34,740 INFO L175 Difference]: Start difference. First operand has 292 places, 305 transitions, 769 flow. Second operand 3 states and 930 transitions. [2025-03-13 22:26:34,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 304 transitions, 791 flow [2025-03-13 22:26:34,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 304 transitions, 791 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:34,747 INFO L231 Difference]: Finished difference. Result has 293 places, 304 transitions, 769 flow [2025-03-13 22:26:34,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=293, PETRI_TRANSITIONS=304} [2025-03-13 22:26:34,748 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2025-03-13 22:26:34,749 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 304 transitions, 769 flow [2025-03-13 22:26:34,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:34,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:26:34,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:34,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1198782968, now seen corresponding path program 1 times [2025-03-13 22:26:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43574590] [2025-03-13 22:26:34,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:34,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-13 22:26:34,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-13 22:26:34,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:34,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:34,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43574590] [2025-03-13 22:26:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43574590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:34,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:34,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:34,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466850298] [2025-03-13 22:26:34,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:34,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:34,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:34,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:34,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-13 22:26:34,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 304 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:34,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-13 22:26:34,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:34,961 INFO L124 PetriNetUnfolderBase]: 136/970 cut-off events. [2025-03-13 22:26:34,961 INFO L125 PetriNetUnfolderBase]: For 98/99 co-relation queries the response was YES. [2025-03-13 22:26:34,964 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-03-13 22:26:34,966 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 15 selfloop transitions, 2 changer transitions 28/307 dead transitions. [2025-03-13 22:26:34,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 307 transitions, 817 flow [2025-03-13 22:26:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-03-13 22:26:34,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9051808406647116 [2025-03-13 22:26:34,969 INFO L175 Difference]: Start difference. First operand has 293 places, 304 transitions, 769 flow. Second operand 3 states and 926 transitions. [2025-03-13 22:26:34,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 307 transitions, 817 flow [2025-03-13 22:26:34,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:34,973 INFO L231 Difference]: Finished difference. Result has 292 places, 274 transitions, 644 flow [2025-03-13 22:26:34,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=292, PETRI_TRANSITIONS=274} [2025-03-13 22:26:34,974 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2025-03-13 22:26:34,974 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 274 transitions, 644 flow [2025-03-13 22:26:34,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:34,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:34,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:26:34,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:34,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:34,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1197599575, now seen corresponding path program 1 times [2025-03-13 22:26:34,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:34,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394422295] [2025-03-13 22:26:34,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:34,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:34,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-13 22:26:34,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-13 22:26:35,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:35,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:26:35,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:35,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394422295] [2025-03-13 22:26:35,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394422295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:35,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:35,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:35,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844923934] [2025-03-13 22:26:35,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:35,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:35,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:35,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:35,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:35,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 341 [2025-03-13 22:26:35,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 274 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:35,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:35,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 341 [2025-03-13 22:26:35,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:36,114 INFO L124 PetriNetUnfolderBase]: 231/1287 cut-off events. [2025-03-13 22:26:36,115 INFO L125 PetriNetUnfolderBase]: For 159/166 co-relation queries the response was YES. [2025-03-13 22:26:36,118 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-03-13 22:26:36,121 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 47 selfloop transitions, 10 changer transitions 0/299 dead transitions. [2025-03-13 22:26:36,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 299 transitions, 824 flow [2025-03-13 22:26:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2025-03-13 22:26:36,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8665689149560117 [2025-03-13 22:26:36,124 INFO L175 Difference]: Start difference. First operand has 292 places, 274 transitions, 644 flow. Second operand 6 states and 1773 transitions. [2025-03-13 22:26:36,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 299 transitions, 824 flow [2025-03-13 22:26:36,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 299 transitions, 768 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-13 22:26:36,129 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 668 flow [2025-03-13 22:26:36,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2025-03-13 22:26:36,131 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2025-03-13 22:26:36,131 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 668 flow [2025-03-13 22:26:36,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:36,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:26:36,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:36,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1531039719, now seen corresponding path program 1 times [2025-03-13 22:26:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:36,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210548917] [2025-03-13 22:26:36,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:36,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:36,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-13 22:26:36,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-13 22:26:36,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:36,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:26:36,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210548917] [2025-03-13 22:26:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210548917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:36,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:36,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159340173] [2025-03-13 22:26:36,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:36,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:36,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:36,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:36,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:36,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-13 22:26:36,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:36,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-13 22:26:36,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:36,393 INFO L124 PetriNetUnfolderBase]: 283/1423 cut-off events. [2025-03-13 22:26:36,394 INFO L125 PetriNetUnfolderBase]: For 823/835 co-relation queries the response was YES. [2025-03-13 22:26:36,399 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-03-13 22:26:36,404 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 22 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-03-13 22:26:36,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 288 transitions, 738 flow [2025-03-13 22:26:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-03-13 22:26:36,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042033235581622 [2025-03-13 22:26:36,407 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 668 flow. Second operand 3 states and 925 transitions. [2025-03-13 22:26:36,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 288 transitions, 738 flow [2025-03-13 22:26:36,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 288 transitions, 728 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:36,411 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 662 flow [2025-03-13 22:26:36,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2025-03-13 22:26:36,413 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-03-13 22:26:36,413 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 662 flow [2025-03-13 22:26:36,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:36,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:36,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:26:36,414 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:36,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1655297604, now seen corresponding path program 1 times [2025-03-13 22:26:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:36,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546149536] [2025-03-13 22:26:36,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:36,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-13 22:26:36,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-13 22:26:36,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:36,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:26:36,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:36,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546149536] [2025-03-13 22:26:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546149536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:36,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:36,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828286833] [2025-03-13 22:26:36,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:36,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:36,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:36,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:36,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:36,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 341 [2025-03-13 22:26:36,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:36,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 341 [2025-03-13 22:26:36,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:36,686 INFO L124 PetriNetUnfolderBase]: 194/1198 cut-off events. [2025-03-13 22:26:36,686 INFO L125 PetriNetUnfolderBase]: For 421/431 co-relation queries the response was YES. [2025-03-13 22:26:36,691 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-03-13 22:26:36,696 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 21 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2025-03-13 22:26:36,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 293 transitions, 764 flow [2025-03-13 22:26:36,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2025-03-13 22:26:36,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139784946236559 [2025-03-13 22:26:36,699 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 662 flow. Second operand 3 states and 935 transitions. [2025-03-13 22:26:36,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 293 transitions, 764 flow [2025-03-13 22:26:36,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:36,704 INFO L231 Difference]: Finished difference. Result has 283 places, 287 transitions, 721 flow [2025-03-13 22:26:36,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=283, PETRI_TRANSITIONS=287} [2025-03-13 22:26:36,705 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2025-03-13 22:26:36,705 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 287 transitions, 721 flow [2025-03-13 22:26:36,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:36,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:36,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:26:36,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:36,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash -924112677, now seen corresponding path program 1 times [2025-03-13 22:26:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:36,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603651000] [2025-03-13 22:26:36,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:36,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-13 22:26:36,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-13 22:26:36,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:36,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:26:37,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603651000] [2025-03-13 22:26:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603651000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-13 22:26:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463682756] [2025-03-13 22:26:37,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:37,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-13 22:26:37,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:37,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-13 22:26:37,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-03-13 22:26:40,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 341 [2025-03-13 22:26:40,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 287 transitions, 721 flow. Second operand has 22 states, 22 states have (on average 254.45454545454547) internal successors, (5598), 22 states have internal predecessors, (5598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:40,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:40,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 341 [2025-03-13 22:26:40,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:42,280 INFO L124 PetriNetUnfolderBase]: 1226/4757 cut-off events. [2025-03-13 22:26:42,281 INFO L125 PetriNetUnfolderBase]: For 2170/2283 co-relation queries the response was YES. [2025-03-13 22:26:42,297 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-03-13 22:26:42,314 INFO L140 encePairwiseOnDemand]: 306/341 looper letters, 105 selfloop transitions, 53 changer transitions 4/369 dead transitions. [2025-03-13 22:26:42,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 369 transitions, 1430 flow [2025-03-13 22:26:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-13 22:26:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-13 22:26:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8436 transitions. [2025-03-13 22:26:42,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7496667555318581 [2025-03-13 22:26:42,328 INFO L175 Difference]: Start difference. First operand has 283 places, 287 transitions, 721 flow. Second operand 33 states and 8436 transitions. [2025-03-13 22:26:42,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 369 transitions, 1430 flow [2025-03-13 22:26:42,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 369 transitions, 1430 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:42,334 INFO L231 Difference]: Finished difference. Result has 320 places, 308 transitions, 1023 flow [2025-03-13 22:26:42,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1023, PETRI_PLACES=320, PETRI_TRANSITIONS=308} [2025-03-13 22:26:42,336 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 5 predicate places. [2025-03-13 22:26:42,336 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 308 transitions, 1023 flow [2025-03-13 22:26:42,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 254.45454545454547) internal successors, (5598), 22 states have internal predecessors, (5598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:42,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:42,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:42,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:26:42,338 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:42,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1574130053, now seen corresponding path program 2 times [2025-03-13 22:26:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:42,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431728398] [2025-03-13 22:26:42,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:26:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:42,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-13 22:26:42,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 160 of 202 statements. [2025-03-13 22:26:42,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:26:42,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:26:43,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431728398] [2025-03-13 22:26:43,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431728398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:43,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:43,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-13 22:26:43,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888110106] [2025-03-13 22:26:43,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:43,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 22:26:43,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:43,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 22:26:43,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-13 22:26:45,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 341 [2025-03-13 22:26:45,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 308 transitions, 1023 flow. Second operand has 20 states, 20 states have (on average 256.6) internal successors, (5132), 20 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:45,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:45,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 341 [2025-03-13 22:26:45,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:46,655 INFO L124 PetriNetUnfolderBase]: 1245/5462 cut-off events. [2025-03-13 22:26:46,655 INFO L125 PetriNetUnfolderBase]: For 5364/5513 co-relation queries the response was YES. [2025-03-13 22:26:46,680 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-03-13 22:26:46,698 INFO L140 encePairwiseOnDemand]: 306/341 looper letters, 84 selfloop transitions, 74 changer transitions 0/369 dead transitions. [2025-03-13 22:26:46,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 369 transitions, 1707 flow [2025-03-13 22:26:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-13 22:26:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-13 22:26:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8488 transitions. [2025-03-13 22:26:46,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542877454900915 [2025-03-13 22:26:46,712 INFO L175 Difference]: Start difference. First operand has 320 places, 308 transitions, 1023 flow. Second operand 33 states and 8488 transitions. [2025-03-13 22:26:46,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 369 transitions, 1707 flow [2025-03-13 22:26:46,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 369 transitions, 1656 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-13 22:26:46,723 INFO L231 Difference]: Finished difference. Result has 327 places, 336 transitions, 1421 flow [2025-03-13 22:26:46,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1421, PETRI_PLACES=327, PETRI_TRANSITIONS=336} [2025-03-13 22:26:46,724 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 12 predicate places. [2025-03-13 22:26:46,724 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 336 transitions, 1421 flow [2025-03-13 22:26:46,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 256.6) internal successors, (5132), 20 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:46,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:46,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:46,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:26:46,726 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:46,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:46,727 INFO L85 PathProgramCache]: Analyzing trace with hash 889348095, now seen corresponding path program 1 times [2025-03-13 22:26:46,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:46,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408885725] [2025-03-13 22:26:46,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:46,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:46,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-13 22:26:46,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-13 22:26:46,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:46,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:26:47,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:47,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408885725] [2025-03-13 22:26:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408885725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:47,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:47,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056729594] [2025-03-13 22:26:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:47,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:47,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:47,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:47,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 341 [2025-03-13 22:26:47,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 336 transitions, 1421 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:47,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:47,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 341 [2025-03-13 22:26:47,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,015 INFO L124 PetriNetUnfolderBase]: 1531/6031 cut-off events. [2025-03-13 22:26:48,015 INFO L125 PetriNetUnfolderBase]: For 10376/10511 co-relation queries the response was YES. [2025-03-13 22:26:48,039 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-03-13 22:26:48,060 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 74 selfloop transitions, 23 changer transitions 0/369 dead transitions. [2025-03-13 22:26:48,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 369 transitions, 1783 flow [2025-03-13 22:26:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1771 transitions. [2025-03-13 22:26:48,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655913978494624 [2025-03-13 22:26:48,063 INFO L175 Difference]: Start difference. First operand has 327 places, 336 transitions, 1421 flow. Second operand 6 states and 1771 transitions. [2025-03-13 22:26:48,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 369 transitions, 1783 flow [2025-03-13 22:26:48,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 369 transitions, 1700 flow, removed 16 selfloop flow, removed 26 redundant places. [2025-03-13 22:26:48,084 INFO L231 Difference]: Finished difference. Result has 311 places, 353 transitions, 1582 flow [2025-03-13 22:26:48,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1582, PETRI_PLACES=311, PETRI_TRANSITIONS=353} [2025-03-13 22:26:48,085 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -4 predicate places. [2025-03-13 22:26:48,085 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 353 transitions, 1582 flow [2025-03-13 22:26:48,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,086 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:48,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:26:48,086 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1148437364, now seen corresponding path program 1 times [2025-03-13 22:26:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907553888] [2025-03-13 22:26:48,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-13 22:26:48,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-13 22:26:48,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 22:26:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907553888] [2025-03-13 22:26:48,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907553888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:26:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537331347] [2025-03-13 22:26:48,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:26:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:48,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:26:48,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:26:48,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-13 22:26:48,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-13 22:26:48,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 22:26:48,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:26:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 22:26:48,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:26:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 22:26:49,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537331347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:26:49,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:26:49,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-13 22:26:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332220252] [2025-03-13 22:26:49,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:26:49,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 22:26:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:49,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 22:26:49,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-13 22:26:49,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 341 [2025-03-13 22:26:49,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 353 transitions, 1582 flow. Second operand has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 341 [2025-03-13 22:26:49,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:51,830 INFO L124 PetriNetUnfolderBase]: 2977/10478 cut-off events. [2025-03-13 22:26:51,830 INFO L125 PetriNetUnfolderBase]: For 22181/23553 co-relation queries the response was YES. [2025-03-13 22:26:51,866 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-03-13 22:26:51,895 INFO L140 encePairwiseOnDemand]: 299/341 looper letters, 137 selfloop transitions, 95 changer transitions 0/488 dead transitions. [2025-03-13 22:26:51,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 488 transitions, 2696 flow [2025-03-13 22:26:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-13 22:26:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-13 22:26:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6226 transitions. [2025-03-13 22:26:51,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7938288920056101 [2025-03-13 22:26:51,901 INFO L175 Difference]: Start difference. First operand has 311 places, 353 transitions, 1582 flow. Second operand 23 states and 6226 transitions. [2025-03-13 22:26:51,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 488 transitions, 2696 flow [2025-03-13 22:26:51,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 488 transitions, 2664 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:51,942 INFO L231 Difference]: Finished difference. Result has 346 places, 417 transitions, 2199 flow [2025-03-13 22:26:51,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2199, PETRI_PLACES=346, PETRI_TRANSITIONS=417} [2025-03-13 22:26:51,943 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 31 predicate places. [2025-03-13 22:26:51,944 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 417 transitions, 2199 flow [2025-03-13 22:26:51,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:51,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:51,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 22:26:52,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-13 22:26:52,151 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:52,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash 776828353, now seen corresponding path program 1 times [2025-03-13 22:26:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610201306] [2025-03-13 22:26:52,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:52,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:52,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-13 22:26:52,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-13 22:26:52,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:52,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-13 22:26:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610201306] [2025-03-13 22:26:52,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610201306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:52,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:52,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563810606] [2025-03-13 22:26:52,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:52,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:52,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:52,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:52,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:52,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2025-03-13 22:26:52,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 417 transitions, 2199 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:52,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:52,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2025-03-13 22:26:52,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:54,134 INFO L124 PetriNetUnfolderBase]: 2446/10380 cut-off events. [2025-03-13 22:26:54,134 INFO L125 PetriNetUnfolderBase]: For 20333/20698 co-relation queries the response was YES. [2025-03-13 22:26:54,216 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-03-13 22:26:54,258 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 42 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-03-13 22:26:54,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 423 transitions, 2323 flow [2025-03-13 22:26:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-03-13 22:26:54,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022482893450635 [2025-03-13 22:26:54,260 INFO L175 Difference]: Start difference. First operand has 346 places, 417 transitions, 2199 flow. Second operand 3 states and 923 transitions. [2025-03-13 22:26:54,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 423 transitions, 2323 flow [2025-03-13 22:26:54,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 423 transitions, 2291 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:54,319 INFO L231 Difference]: Finished difference. Result has 346 places, 416 transitions, 2169 flow [2025-03-13 22:26:54,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2169, PETRI_PLACES=346, PETRI_TRANSITIONS=416} [2025-03-13 22:26:54,320 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 31 predicate places. [2025-03-13 22:26:54,320 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 416 transitions, 2169 flow [2025-03-13 22:26:54,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:54,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:54,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:54,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:26:54,322 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:26:54,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1473740291, now seen corresponding path program 1 times [2025-03-13 22:26:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:54,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311956038] [2025-03-13 22:26:54,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:54,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-13 22:26:54,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-13 22:26:54,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:54,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 22:26:54,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311956038] [2025-03-13 22:26:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311956038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:26:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015311249] [2025-03-13 22:26:54,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:54,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:26:54,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:54,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:26:54,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 22:26:54,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-13 22:26:54,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-13 22:26:54,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:54,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:54,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-13 22:26:54,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:26:55,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-13 22:26:55,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:26:55,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:26:55,320 INFO L349 Elim1Store]: treesize reduction 424, result has 7.6 percent of original size [2025-03-13 22:26:55,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 77 [2025-03-13 22:26:55,326 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 77 treesize of output 58 [2025-03-13 22:26:55,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2025-03-13 22:26:55,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2025-03-13 22:26:55,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2025-03-13 22:26:55,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2025-03-13 22:26:55,387 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 79 treesize of output 69 [2025-03-13 22:26:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 22:26:55,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:26:55,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:26:55,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-13 22:26:55,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:26:55,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-13 22:26:55,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2025-03-13 22:26:55,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:26:55,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2025-03-13 22:26:55,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-13 22:26:55,499 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:26:55,503 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:26:55,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-13 22:26:55,509 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:26:55,514 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:26:55,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-13 22:26:55,518 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:26:55,523 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:26:55,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-13 22:26:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 22:26:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015311249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:26:55,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:26:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-13 22:26:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324816072] [2025-03-13 22:26:55,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:26:55,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-13 22:26:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:55,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-13 22:26:55,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-13 22:26:57,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 341 [2025-03-13 22:26:57,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 416 transitions, 2169 flow. Second operand has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:57,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:57,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 341 [2025-03-13 22:26:57,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:58,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([865] 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-03-13 22:26:58,342 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is not cut-off event [2025-03-13 22:26:58,342 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-03-13 22:26:58,342 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-03-13 22:26:58,342 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is not cut-off event [2025-03-13 22:26:59,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([865] 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-03-13 22:26:59,336 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is not cut-off event [2025-03-13 22:26:59,336 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is not cut-off event [2025-03-13 22:26:59,336 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is not cut-off event [2025-03-13 22:26:59,336 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is not cut-off event [2025-03-13 22:26:59,794 INFO L124 PetriNetUnfolderBase]: 3396/12612 cut-off events. [2025-03-13 22:26:59,794 INFO L125 PetriNetUnfolderBase]: For 30585/31643 co-relation queries the response was YES. [2025-03-13 22:26:59,899 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-03-13 22:26:59,938 INFO L140 encePairwiseOnDemand]: 309/341 looper letters, 151 selfloop transitions, 83 changer transitions 0/507 dead transitions. [2025-03-13 22:26:59,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 507 transitions, 3307 flow [2025-03-13 22:26:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-13 22:26:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-13 22:26:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6554 transitions. [2025-03-13 22:26:59,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7687976539589443 [2025-03-13 22:26:59,941 INFO L175 Difference]: Start difference. First operand has 346 places, 416 transitions, 2169 flow. Second operand 25 states and 6554 transitions. [2025-03-13 22:26:59,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 507 transitions, 3307 flow [2025-03-13 22:27:00,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 507 transitions, 3303 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:00,008 INFO L231 Difference]: Finished difference. Result has 373 places, 432 transitions, 2600 flow [2025-03-13 22:27:00,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2600, PETRI_PLACES=373, PETRI_TRANSITIONS=432} [2025-03-13 22:27:00,008 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 58 predicate places. [2025-03-13 22:27:00,008 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 432 transitions, 2600 flow [2025-03-13 22:27:00,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:00,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:00,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:00,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 22:27:00,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-13 22:27:00,211 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:27:00,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1176169987, now seen corresponding path program 2 times [2025-03-13 22:27:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181653032] [2025-03-13 22:27:00,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:27:00,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:00,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-03-13 22:27:00,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-13 22:27:00,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:27:00,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:27:00,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:00,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181653032] [2025-03-13 22:27:00,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181653032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:27:00,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711164464] [2025-03-13 22:27:00,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:27:00,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:27:00,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:27:00,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:27:00,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 22:27:01,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-03-13 22:27:01,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-13 22:27:01,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:27:01,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:01,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-13 22:27:01,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:27:01,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-13 22:27:01,305 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:27:01,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:27:01,584 INFO L349 Elim1Store]: treesize reduction 424, result has 7.6 percent of original size [2025-03-13 22:27:01,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 77 [2025-03-13 22:27:01,587 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 77 treesize of output 58 [2025-03-13 22:27:01,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2025-03-13 22:27:01,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2025-03-13 22:27:01,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2025-03-13 22:27:01,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2025-03-13 22:27:01,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 45 [2025-03-13 22:27:01,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2025-03-13 22:27:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 22:27:01,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:27:01,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:27:01,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-13 22:27:01,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:27:01,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-13 22:27:01,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-13 22:27:01,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:27:01,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2025-03-13 22:27:01,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-13 22:27:01,734 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:27:01,737 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:27:01,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-13 22:27:01,738 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:27:01,742 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:27:01,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-13 22:27:01,743 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:27:01,747 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:27:01,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-13 22:27:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 22:27:01,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711164464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:27:01,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:27:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 38 [2025-03-13 22:27:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540074807] [2025-03-13 22:27:01,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:27:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-13 22:27:01,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:01,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-13 22:27:01,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2025-03-13 22:27:05,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 341 [2025-03-13 22:27:05,308 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-03-13 22:27:05,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:05,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 341 [2025-03-13 22:27:05,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:09,288 INFO L124 PetriNetUnfolderBase]: 3772/14991 cut-off events. [2025-03-13 22:27:09,288 INFO L125 PetriNetUnfolderBase]: For 52837/54245 co-relation queries the response was YES. [2025-03-13 22:27:09,392 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-03-13 22:27:09,439 INFO L140 encePairwiseOnDemand]: 288/341 looper letters, 153 selfloop transitions, 148 changer transitions 0/524 dead transitions. [2025-03-13 22:27:09,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 524 transitions, 3929 flow [2025-03-13 22:27:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-13 22:27:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-13 22:27:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 7673 transitions. [2025-03-13 22:27:09,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081477371799953 [2025-03-13 22:27:09,444 INFO L175 Difference]: Start difference. First operand has 373 places, 432 transitions, 2600 flow. Second operand 37 states and 7673 transitions. [2025-03-13 22:27:09,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 524 transitions, 3929 flow [2025-03-13 22:27:09,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 524 transitions, 3866 flow, removed 1 selfloop flow, removed 19 redundant places. [2025-03-13 22:27:09,582 INFO L231 Difference]: Finished difference. Result has 394 places, 458 transitions, 3264 flow [2025-03-13 22:27:09,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=3264, PETRI_PLACES=394, PETRI_TRANSITIONS=458} [2025-03-13 22:27:09,583 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 79 predicate places. [2025-03-13 22:27:09,583 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 458 transitions, 3264 flow [2025-03-13 22:27:09,586 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-03-13 22:27:09,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:09,586 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:09,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 22:27:09,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:27:09,787 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:27:09,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash -18608611, now seen corresponding path program 1 times [2025-03-13 22:27:09,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:09,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970155321] [2025-03-13 22:27:09,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:09,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-13 22:27:09,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-13 22:27:09,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:09,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-13 22:27:09,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:09,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970155321] [2025-03-13 22:27:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970155321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:27:09,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556989916] [2025-03-13 22:27:09,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:27:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:27:09,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:27:09,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 22:27:10,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-13 22:27:10,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-13 22:27:10,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:10,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:10,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 22:27:10,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:27:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-13 22:27:10,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:27:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-13 22:27:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556989916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:27:10,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:27:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-13 22:27:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678247299] [2025-03-13 22:27:10,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:27:10,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 22:27:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:10,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 22:27:10,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-13 22:27:11,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 341 [2025-03-13 22:27:11,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-03-13 22:27:11,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:11,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 341 [2025-03-13 22:27:11,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:14,141 INFO L124 PetriNetUnfolderBase]: 2298/10935 cut-off events. [2025-03-13 22:27:14,142 INFO L125 PetriNetUnfolderBase]: For 43754/43915 co-relation queries the response was YES. [2025-03-13 22:27:14,218 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-03-13 22:27:14,245 INFO L140 encePairwiseOnDemand]: 299/341 looper letters, 97 selfloop transitions, 44 changer transitions 156/567 dead transitions. [2025-03-13 22:27:14,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 567 transitions, 4864 flow [2025-03-13 22:27:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-13 22:27:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-13 22:27:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6238 transitions. [2025-03-13 22:27:14,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953589187810787 [2025-03-13 22:27:14,249 INFO L175 Difference]: Start difference. First operand has 394 places, 458 transitions, 3264 flow. Second operand 23 states and 6238 transitions. [2025-03-13 22:27:14,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 567 transitions, 4864 flow [2025-03-13 22:27:14,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 567 transitions, 4713 flow, removed 22 selfloop flow, removed 29 redundant places. [2025-03-13 22:27:14,366 INFO L231 Difference]: Finished difference. Result has 392 places, 398 transitions, 2651 flow [2025-03-13 22:27:14,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3040, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2651, PETRI_PLACES=392, PETRI_TRANSITIONS=398} [2025-03-13 22:27:14,367 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 77 predicate places. [2025-03-13 22:27:14,367 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 398 transitions, 2651 flow [2025-03-13 22:27:14,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.0) internal successors, (6408), 24 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:14,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:14,369 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:14,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 22:27:14,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:27:14,573 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 22:27:14,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash -742663843, now seen corresponding path program 2 times [2025-03-13 22:27:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350322863] [2025-03-13 22:27:14,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:27:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:14,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-03-13 22:27:14,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-03-13 22:27:14,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:27:14,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-13 22:27:17,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350322863] [2025-03-13 22:27:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350322863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:27:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949812240] [2025-03-13 22:27:17,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:27:17,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:27:17,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:27:17,551 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:27:17,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 22:27:17,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-03-13 22:27:17,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-03-13 22:27:17,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:27:17,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:17,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-13 22:27:17,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:27:17,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-13 22:27:18,165 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-13 22:27:18,165 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 17 treesize of output 21 [2025-03-13 22:27:18,651 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-13 22:27:18,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-13 22:27:19,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 22:27:19,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-13 22:27:19,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-13 22:27:19,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-13 22:27:19,692 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 121 treesize of output 127 [2025-03-13 22:27:19,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 22:27:19,698 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 112 treesize of output 100 [2025-03-13 22:27:19,717 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 49 treesize of output 31 [2025-03-13 22:27:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-13 22:27:19,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:27:19,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_thread2Thread1of1ForFork2_~i~1 4))) (let ((.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse2 (+ c_~C~0.offset .cse14)) (.cse3 (+ c_~C~0.offset .cse14 1)) (.cse5 (+ 2 c_~C~0.offset .cse14)) (.cse6 (+ 3 c_~C~0.offset .cse14)) (.cse7 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse14) 0) (+ c_~A~0.offset .cse14 1) 0) (+ c_~A~0.offset 2 .cse14) 0) (+ c_~A~0.offset 3 .cse14) 0)))) (and (forall ((v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (let ((.cse0 (store .cse7 c_~B~0.base v_ArrVal_1240))) (or (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1242) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0) (not (= v_ArrVal_1242 (let ((.cse4 (select v_ArrVal_1242 .cse6))) (store (store (store (store (select .cse0 c_~C~0.base) .cse2 (select v_ArrVal_1242 .cse2)) .cse3 .cse4) .cse5 .cse4) .cse6 .cse4))))))) (forall ((v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (let ((.cse8 (store .cse7 c_~B~0.base v_ArrVal_1240))) (or (= (select (select (store .cse8 c_~C~0.base v_ArrVal_1242) c_~A~0.base) (+ c_~A~0.offset 2 .cse1)) 0) (not (= v_ArrVal_1242 (let ((.cse9 (select v_ArrVal_1242 .cse6))) (store (store (store (store (select .cse8 c_~C~0.base) .cse2 (select v_ArrVal_1242 .cse2)) .cse3 .cse9) .cse5 .cse9) .cse6 .cse9))))))) (forall ((v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (let ((.cse10 (store .cse7 c_~B~0.base v_ArrVal_1240))) (or (= (select (select (store .cse10 c_~C~0.base v_ArrVal_1242) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0) (not (= v_ArrVal_1242 (let ((.cse11 (select v_ArrVal_1242 .cse6))) (store (store (store (store (select .cse10 c_~C~0.base) .cse2 (select v_ArrVal_1242 .cse2)) .cse3 .cse11) .cse5 .cse11) .cse6 .cse11))))))) (forall ((v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (let ((.cse12 (store .cse7 c_~B~0.base v_ArrVal_1240))) (or (= (select (select (store .cse12 c_~C~0.base v_ArrVal_1242) c_~A~0.base) (+ c_~A~0.offset 3 .cse1)) 0) (not (= v_ArrVal_1242 (let ((.cse13 (select v_ArrVal_1242 .cse6))) (store (store (store (store (select .cse12 c_~C~0.base) .cse2 (select v_ArrVal_1242 .cse2)) .cse3 .cse13) .cse5 .cse13) .cse6 .cse13)))))))))) is different from false