./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:44,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:44,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:29:44,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:44,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:44,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:44,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:44,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:44,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:44,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:44,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:44,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:44,975 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:44,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:44,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:44,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:44,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:44,977 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:44,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:44,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:44,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:44,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:44,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:44,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:44,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:44,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:44,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:44,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:44,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:44,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:44,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:44,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:44,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:44,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:44,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:44,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 [2025-01-09 21:29:45,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:45,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:45,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:45,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:45,249 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:45,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-01-09 21:29:46,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/434ccdaa5/bd490c1c3e5f463cb903a95f71bf85e5/FLAG3469d2466 [2025-01-09 21:29:46,788 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:46,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-01-09 21:29:46,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/434ccdaa5/bd490c1c3e5f463cb903a95f71bf85e5/FLAG3469d2466 [2025-01-09 21:29:46,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/434ccdaa5/bd490c1c3e5f463cb903a95f71bf85e5 [2025-01-09 21:29:46,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:46,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:46,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:46,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:46,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:46,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a2e912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46, skipping insertion in model container [2025-01-09 21:29:46,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:47,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:47,046 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:47,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:47,096 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:47,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47 WrapperNode [2025-01-09 21:29:47,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:47,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:47,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:47,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:47,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,135 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-01-09 21:29:47,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:47,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:47,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:47,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:47,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,156 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:47,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:47,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:47,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:47,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (1/1) ... [2025-01-09 21:29:47,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:47,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:47,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:29:47,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:29:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:29:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:29:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:29:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:29:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:29:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:29:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:29:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:29:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:47,222 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:29:47,334 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:47,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:47,955 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:47,956 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:47,981 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:47,982 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:29:47,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:47 BoogieIcfgContainer [2025-01-09 21:29:47,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:47,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:47,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:47,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:47,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:46" (1/3) ... [2025-01-09 21:29:47,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f43083b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:47, skipping insertion in model container [2025-01-09 21:29:47,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:47" (2/3) ... [2025-01-09 21:29:47,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f43083b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:47, skipping insertion in model container [2025-01-09 21:29:47,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:47" (3/3) ... [2025-01-09 21:29:47,993 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2025-01-09 21:29:48,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:48,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x9.wvr.c that has 5 procedures, 534 locations, 1 initial locations, 4 loop locations, and 107 error locations. [2025-01-09 21:29:48,008 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:48,170 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:29:48,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 546 places, 547 transitions, 1122 flow [2025-01-09 21:29:48,432 INFO L124 PetriNetUnfolderBase]: 14/543 cut-off events. [2025-01-09 21:29:48,436 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:29:48,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 543 events. 14/543 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1767 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 413. Up to 2 conditions per place. [2025-01-09 21:29:48,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 546 places, 547 transitions, 1122 flow [2025-01-09 21:29:48,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 524 places, 523 transitions, 1070 flow [2025-01-09 21:29:48,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:48,496 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;@19a1fe5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:48,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 203 error locations. [2025-01-09 21:29:48,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:48,504 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:29:48,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:48,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:48,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:48,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:48,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:48,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1096401154, now seen corresponding path program 1 times [2025-01-09 21:29:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:48,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651611590] [2025-01-09 21:29:48,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:48,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:48,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:29:48,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:29:48,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651611590] [2025-01-09 21:29:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651611590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:48,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:48,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:48,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129466655] [2025-01-09 21:29:48,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:48,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:48,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:48,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:48,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2025-01-09 21:29:48,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 523 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 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-01-09 21:29:48,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:48,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2025-01-09 21:29:48,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,204 INFO L124 PetriNetUnfolderBase]: 76/868 cut-off events. [2025-01-09 21:29:49,205 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-01-09 21:29:49,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 868 events. 76/868 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4798 event pairs, 66 based on Foata normal form. 145/825 useless extension candidates. Maximal degree in co-relation 1049. Up to 172 conditions per place. [2025-01-09 21:29:49,229 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 36 selfloop transitions, 2 changer transitions 1/517 dead transitions. [2025-01-09 21:29:49,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 517 transitions, 1134 flow [2025-01-09 21:29:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1544 transitions. [2025-01-09 21:29:49,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408897014015845 [2025-01-09 21:29:49,247 INFO L175 Difference]: Start difference. First operand has 524 places, 523 transitions, 1070 flow. Second operand 3 states and 1544 transitions. [2025-01-09 21:29:49,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 517 transitions, 1134 flow [2025-01-09 21:29:49,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 517 transitions, 1118 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:29:49,264 INFO L231 Difference]: Finished difference. Result has 517 places, 516 transitions, 1044 flow [2025-01-09 21:29:49,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=517, PETRI_TRANSITIONS=516} [2025-01-09 21:29:49,272 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -7 predicate places. [2025-01-09 21:29:49,272 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 516 transitions, 1044 flow [2025-01-09 21:29:49,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 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-01-09 21:29:49,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,274 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-01-09 21:29:49,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:49,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:49,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1054377333, now seen corresponding path program 1 times [2025-01-09 21:29:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329529375] [2025-01-09 21:29:49,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:29:49,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:29:49,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:49,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329529375] [2025-01-09 21:29:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329529375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:49,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:49,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:49,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882891440] [2025-01-09 21:29:49,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:49,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:49,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:49,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2025-01-09 21:29:49,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 516 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 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-01-09 21:29:49,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2025-01-09 21:29:49,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,712 INFO L124 PetriNetUnfolderBase]: 76/866 cut-off events. [2025-01-09 21:29:49,712 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:29:49,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 866 events. 76/866 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4843 event pairs, 66 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 1061. Up to 171 conditions per place. [2025-01-09 21:29:49,750 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/515 dead transitions. [2025-01-09 21:29:49,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 515 transitions, 1116 flow [2025-01-09 21:29:49,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2025-01-09 21:29:49,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2025-01-09 21:29:49,754 INFO L175 Difference]: Start difference. First operand has 517 places, 516 transitions, 1044 flow. Second operand 3 states and 1541 transitions. [2025-01-09 21:29:49,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 515 transitions, 1116 flow [2025-01-09 21:29:49,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 515 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:49,767 INFO L231 Difference]: Finished difference. Result has 515 places, 515 transitions, 1042 flow [2025-01-09 21:29:49,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=515, PETRI_TRANSITIONS=515} [2025-01-09 21:29:49,769 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -9 predicate places. [2025-01-09 21:29:49,769 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 515 transitions, 1042 flow [2025-01-09 21:29:49,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 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-01-09 21:29:49,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:49,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:49,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 365344854, now seen corresponding path program 1 times [2025-01-09 21:29:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047405084] [2025-01-09 21:29:49,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:29:49,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:29:49,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047405084] [2025-01-09 21:29:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047405084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826945191] [2025-01-09 21:29:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:49,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:49,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2025-01-09 21:29:49,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 515 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 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-01-09 21:29:49,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2025-01-09 21:29:49,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:50,176 INFO L124 PetriNetUnfolderBase]: 76/793 cut-off events. [2025-01-09 21:29:50,176 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-09 21:29:50,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 793 events. 76/793 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4261 event pairs, 66 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 960. Up to 172 conditions per place. [2025-01-09 21:29:50,204 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/514 dead transitions. [2025-01-09 21:29:50,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 514 transitions, 1116 flow [2025-01-09 21:29:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1539 transitions. [2025-01-09 21:29:50,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9378427787934186 [2025-01-09 21:29:50,208 INFO L175 Difference]: Start difference. First operand has 515 places, 515 transitions, 1042 flow. Second operand 3 states and 1539 transitions. [2025-01-09 21:29:50,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 514 transitions, 1116 flow [2025-01-09 21:29:50,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 514 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:50,216 INFO L231 Difference]: Finished difference. Result has 514 places, 514 transitions, 1040 flow [2025-01-09 21:29:50,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=514, PETRI_TRANSITIONS=514} [2025-01-09 21:29:50,219 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -10 predicate places. [2025-01-09 21:29:50,219 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 514 transitions, 1040 flow [2025-01-09 21:29:50,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 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-01-09 21:29:50,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:50,220 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] [2025-01-09 21:29:50,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:50,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:50,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash 116207967, now seen corresponding path program 1 times [2025-01-09 21:29:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:50,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692276456] [2025-01-09 21:29:50,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:50,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:50,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:29:50,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:29:50,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:50,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692276456] [2025-01-09 21:29:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692276456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:50,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023304938] [2025-01-09 21:29:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:50,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:50,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:50,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:50,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2025-01-09 21:29:50,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 514 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 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-01-09 21:29:50,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:50,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2025-01-09 21:29:50,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:50,590 INFO L124 PetriNetUnfolderBase]: 76/720 cut-off events. [2025-01-09 21:29:50,590 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-09 21:29:50,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 720 events. 76/720 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3609 event pairs, 66 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 857. Up to 171 conditions per place. [2025-01-09 21:29:50,617 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/513 dead transitions. [2025-01-09 21:29:50,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 513 transitions, 1112 flow [2025-01-09 21:29:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2025-01-09 21:29:50,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2025-01-09 21:29:50,621 INFO L175 Difference]: Start difference. First operand has 514 places, 514 transitions, 1040 flow. Second operand 3 states and 1541 transitions. [2025-01-09 21:29:50,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 513 transitions, 1112 flow [2025-01-09 21:29:50,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 513 transitions, 1108 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:50,632 INFO L231 Difference]: Finished difference. Result has 513 places, 513 transitions, 1038 flow [2025-01-09 21:29:50,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=513, PETRI_TRANSITIONS=513} [2025-01-09 21:29:50,635 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -11 predicate places. [2025-01-09 21:29:50,635 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 513 transitions, 1038 flow [2025-01-09 21:29:50,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 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-01-09 21:29:50,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:50,636 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] [2025-01-09 21:29:50,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:50,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:50,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash -150309536, now seen corresponding path program 1 times [2025-01-09 21:29:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:50,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811041279] [2025-01-09 21:29:50,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:50,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:50,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:29:50,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:29:50,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:50,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:50,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:50,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811041279] [2025-01-09 21:29:50,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811041279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:50,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:50,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:50,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011493750] [2025-01-09 21:29:50,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:50,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:50,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:50,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:50,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:50,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 521 out of 547 [2025-01-09 21:29:50,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 513 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 522.3333333333334) internal successors, (1567), 3 states have internal predecessors, (1567), 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-01-09 21:29:50,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:50,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 521 of 547 [2025-01-09 21:29:50,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:51,392 INFO L124 PetriNetUnfolderBase]: 102/3430 cut-off events. [2025-01-09 21:29:51,392 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:29:51,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 3430 events. 102/3430 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 31110 event pairs, 51 based on Foata normal form. 0/2582 useless extension candidates. Maximal degree in co-relation 3544. Up to 144 conditions per place. [2025-01-09 21:29:51,466 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 15 selfloop transitions, 2 changer transitions 0/512 dead transitions. [2025-01-09 21:29:51,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 512 transitions, 1070 flow [2025-01-09 21:29:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1581 transitions. [2025-01-09 21:29:51,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9634369287020109 [2025-01-09 21:29:51,474 INFO L175 Difference]: Start difference. First operand has 513 places, 513 transitions, 1038 flow. Second operand 3 states and 1581 transitions. [2025-01-09 21:29:51,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 512 transitions, 1070 flow [2025-01-09 21:29:51,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 512 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:51,484 INFO L231 Difference]: Finished difference. Result has 512 places, 512 transitions, 1036 flow [2025-01-09 21:29:51,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=512, PETRI_TRANSITIONS=512} [2025-01-09 21:29:51,485 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -12 predicate places. [2025-01-09 21:29:51,485 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 512 transitions, 1036 flow [2025-01-09 21:29:51,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 522.3333333333334) internal successors, (1567), 3 states have internal predecessors, (1567), 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-01-09 21:29:51,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,487 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] [2025-01-09 21:29:51,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:51,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:51,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash -640645644, now seen corresponding path program 1 times [2025-01-09 21:29:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497500392] [2025-01-09 21:29:51,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:29:51,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:29:51,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:51,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497500392] [2025-01-09 21:29:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497500392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296566187] [2025-01-09 21:29:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:51,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:51,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:51,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:51,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2025-01-09 21:29:51,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 512 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 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-01-09 21:29:51,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:51,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2025-01-09 21:29:51,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:51,838 INFO L124 PetriNetUnfolderBase]: 121/846 cut-off events. [2025-01-09 21:29:51,838 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:29:51,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 846 events. 121/846 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4982 event pairs, 90 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 1186. Up to 228 conditions per place. [2025-01-09 21:29:51,861 INFO L140 encePairwiseOnDemand]: 514/547 looper letters, 41 selfloop transitions, 15 changer transitions 0/498 dead transitions. [2025-01-09 21:29:51,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 498 transitions, 1123 flow [2025-01-09 21:29:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-01-09 21:29:51,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9043266301035954 [2025-01-09 21:29:51,865 INFO L175 Difference]: Start difference. First operand has 512 places, 512 transitions, 1036 flow. Second operand 3 states and 1484 transitions. [2025-01-09 21:29:51,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 498 transitions, 1123 flow [2025-01-09 21:29:51,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 498 transitions, 1119 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:51,875 INFO L231 Difference]: Finished difference. Result has 495 places, 495 transitions, 1045 flow [2025-01-09 21:29:51,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=495, PETRI_TRANSITIONS=495} [2025-01-09 21:29:51,877 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -29 predicate places. [2025-01-09 21:29:51,877 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 495 transitions, 1045 flow [2025-01-09 21:29:51,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 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-01-09 21:29:51,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,878 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] [2025-01-09 21:29:51,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:51,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:51,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1480103044, now seen corresponding path program 1 times [2025-01-09 21:29:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970145706] [2025-01-09 21:29:51,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:29:51,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:29:51,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970145706] [2025-01-09 21:29:51,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970145706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:51,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:51,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:51,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750223771] [2025-01-09 21:29:51,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:51,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:51,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:51,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:51,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:52,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2025-01-09 21:29:52,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 495 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 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-01-09 21:29:52,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2025-01-09 21:29:52,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:52,234 INFO L124 PetriNetUnfolderBase]: 121/830 cut-off events. [2025-01-09 21:29:52,234 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-09 21:29:52,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 830 events. 121/830 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4932 event pairs, 90 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 1066. Up to 226 conditions per place. [2025-01-09 21:29:52,265 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 39 selfloop transitions, 15 changer transitions 0/482 dead transitions. [2025-01-09 21:29:52,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 482 transitions, 1130 flow [2025-01-09 21:29:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1490 transitions. [2025-01-09 21:29:52,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079829372333943 [2025-01-09 21:29:52,269 INFO L175 Difference]: Start difference. First operand has 495 places, 495 transitions, 1045 flow. Second operand 3 states and 1490 transitions. [2025-01-09 21:29:52,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 482 transitions, 1130 flow [2025-01-09 21:29:52,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 482 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:52,280 INFO L231 Difference]: Finished difference. Result has 480 places, 479 transitions, 1045 flow [2025-01-09 21:29:52,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=480, PETRI_TRANSITIONS=479} [2025-01-09 21:29:52,283 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -44 predicate places. [2025-01-09 21:29:52,283 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 479 transitions, 1045 flow [2025-01-09 21:29:52,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 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-01-09 21:29:52,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:52,284 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] [2025-01-09 21:29:52,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:29:52,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash -782692740, now seen corresponding path program 1 times [2025-01-09 21:29:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112317869] [2025-01-09 21:29:52,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:52,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:29:52,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:29:52,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:52,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:52,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:52,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112317869] [2025-01-09 21:29:52,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112317869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:52,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:52,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:52,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050288226] [2025-01-09 21:29:52,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:52,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:52,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:52,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:52,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2025-01-09 21:29:52,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 479 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 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-01-09 21:29:52,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2025-01-09 21:29:52,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:52,810 INFO L124 PetriNetUnfolderBase]: 128/1092 cut-off events. [2025-01-09 21:29:52,811 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-01-09 21:29:52,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1092 events. 128/1092 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6938 event pairs, 21 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1271. Up to 232 conditions per place. [2025-01-09 21:29:52,853 INFO L140 encePairwiseOnDemand]: 513/547 looper letters, 44 selfloop transitions, 16 changer transitions 0/469 dead transitions. [2025-01-09 21:29:52,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 469 transitions, 1151 flow [2025-01-09 21:29:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1488 transitions. [2025-01-09 21:29:52,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.906764168190128 [2025-01-09 21:29:52,858 INFO L175 Difference]: Start difference. First operand has 480 places, 479 transitions, 1045 flow. Second operand 3 states and 1488 transitions. [2025-01-09 21:29:52,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 469 transitions, 1151 flow [2025-01-09 21:29:52,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 469 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:52,870 INFO L231 Difference]: Finished difference. Result has 464 places, 463 transitions, 1050 flow [2025-01-09 21:29:52,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=464, PETRI_TRANSITIONS=463} [2025-01-09 21:29:52,872 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -60 predicate places. [2025-01-09 21:29:52,872 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 463 transitions, 1050 flow [2025-01-09 21:29:52,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 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-01-09 21:29:52,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:52,874 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] [2025-01-09 21:29:52,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:29:52,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:52,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash -548409898, now seen corresponding path program 1 times [2025-01-09 21:29:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:52,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916780641] [2025-01-09 21:29:52,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:52,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:29:52,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:29:52,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916780641] [2025-01-09 21:29:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916780641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:52,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:52,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:29:52,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627269069] [2025-01-09 21:29:52,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:52,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:29:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:52,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:29:52,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:29:52,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 520 out of 547 [2025-01-09 21:29:52,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 463 transitions, 1050 flow. Second operand has 4 states, 4 states have (on average 521.25) internal successors, (2085), 4 states have internal predecessors, (2085), 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-01-09 21:29:52,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 520 of 547 [2025-01-09 21:29:52,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:53,149 INFO L124 PetriNetUnfolderBase]: 12/791 cut-off events. [2025-01-09 21:29:53,149 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:29:53,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 791 events. 12/791 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3577 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 657. Up to 26 conditions per place. [2025-01-09 21:29:53,164 INFO L140 encePairwiseOnDemand]: 541/547 looper letters, 19 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2025-01-09 21:29:53,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 468 transitions, 1108 flow [2025-01-09 21:29:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:29:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:29:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2625 transitions. [2025-01-09 21:29:53,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9597806215722121 [2025-01-09 21:29:53,170 INFO L175 Difference]: Start difference. First operand has 464 places, 463 transitions, 1050 flow. Second operand 5 states and 2625 transitions. [2025-01-09 21:29:53,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 468 transitions, 1108 flow [2025-01-09 21:29:53,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 468 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:53,177 INFO L231 Difference]: Finished difference. Result has 471 places, 467 transitions, 1072 flow [2025-01-09 21:29:53,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1072, PETRI_PLACES=471, PETRI_TRANSITIONS=467} [2025-01-09 21:29:53,178 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -53 predicate places. [2025-01-09 21:29:53,179 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 467 transitions, 1072 flow [2025-01-09 21:29:53,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 521.25) internal successors, (2085), 4 states have internal predecessors, (2085), 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-01-09 21:29:53,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:53,180 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] [2025-01-09 21:29:53,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:29:53,180 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:53,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash -590741660, now seen corresponding path program 1 times [2025-01-09 21:29:53,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:53,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976804188] [2025-01-09 21:29:53,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:53,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:53,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:29:53,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:29:53,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:53,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:53,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976804188] [2025-01-09 21:29:53,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976804188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:53,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:53,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:53,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083314885] [2025-01-09 21:29:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:53,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:53,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:53,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:53,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2025-01-09 21:29:53,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 467 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 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-01-09 21:29:53,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:53,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2025-01-09 21:29:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:53,660 INFO L124 PetriNetUnfolderBase]: 208/1557 cut-off events. [2025-01-09 21:29:53,660 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-01-09 21:29:53,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 1557 events. 208/1557 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11514 event pairs, 35 based on Foata normal form. 1/1441 useless extension candidates. Maximal degree in co-relation 1733. Up to 380 conditions per place. [2025-01-09 21:29:53,703 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 40 selfloop transitions, 15 changer transitions 10/458 dead transitions. [2025-01-09 21:29:53,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 458 transitions, 1175 flow [2025-01-09 21:29:53,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1493 transitions. [2025-01-09 21:29:53,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098110907982937 [2025-01-09 21:29:53,707 INFO L175 Difference]: Start difference. First operand has 471 places, 467 transitions, 1072 flow. Second operand 3 states and 1493 transitions. [2025-01-09 21:29:53,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 458 transitions, 1175 flow [2025-01-09 21:29:53,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 458 transitions, 1175 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:53,716 INFO L231 Difference]: Finished difference. Result has 457 places, 441 transitions, 1066 flow [2025-01-09 21:29:53,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=457, PETRI_TRANSITIONS=441} [2025-01-09 21:29:53,717 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -67 predicate places. [2025-01-09 21:29:53,717 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 441 transitions, 1066 flow [2025-01-09 21:29:53,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 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-01-09 21:29:53,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:53,719 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] [2025-01-09 21:29:53,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:29:53,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:53,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1696481482, now seen corresponding path program 1 times [2025-01-09 21:29:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:53,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010109046] [2025-01-09 21:29:53,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:53,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:29:53,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:29:53,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:53,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010109046] [2025-01-09 21:29:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010109046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905685323] [2025-01-09 21:29:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:53,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:53,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:53,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 519 out of 547 [2025-01-09 21:29:53,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 441 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 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-01-09 21:29:53,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:53,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 519 of 547 [2025-01-09 21:29:53,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:55,620 INFO L124 PetriNetUnfolderBase]: 751/14488 cut-off events. [2025-01-09 21:29:55,620 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-01-09 21:29:55,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18474 conditions, 14488 events. 751/14488 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 189606 event pairs, 349 based on Foata normal form. 0/12925 useless extension candidates. Maximal degree in co-relation 14026. Up to 1015 conditions per place. [2025-01-09 21:29:55,852 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 19 selfloop transitions, 4 changer transitions 0/444 dead transitions. [2025-01-09 21:29:55,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 444 transitions, 1121 flow [2025-01-09 21:29:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1584 transitions. [2025-01-09 21:29:55,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652650822669104 [2025-01-09 21:29:55,856 INFO L175 Difference]: Start difference. First operand has 457 places, 441 transitions, 1066 flow. Second operand 3 states and 1584 transitions. [2025-01-09 21:29:55,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 444 transitions, 1121 flow [2025-01-09 21:29:55,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 444 transitions, 1106 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:55,871 INFO L231 Difference]: Finished difference. Result has 445 places, 441 transitions, 1071 flow [2025-01-09 21:29:55,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1071, PETRI_PLACES=445, PETRI_TRANSITIONS=441} [2025-01-09 21:29:55,872 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2025-01-09 21:29:55,873 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 441 transitions, 1071 flow [2025-01-09 21:29:55,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 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-01-09 21:29:55,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:55,874 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] [2025-01-09 21:29:55,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:29:55,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:55,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1136189698, now seen corresponding path program 1 times [2025-01-09 21:29:55,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:55,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357392086] [2025-01-09 21:29:55,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:55,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:29:55,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:29:55,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:55,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357392086] [2025-01-09 21:29:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357392086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:55,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:55,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957462938] [2025-01-09 21:29:55,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:55,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:55,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:55,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:56,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:29:56,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 441 transitions, 1071 flow. Second operand has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 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-01-09 21:29:56,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:56,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:29:56,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:56,731 INFO L124 PetriNetUnfolderBase]: 365/4355 cut-off events. [2025-01-09 21:29:56,731 INFO L125 PetriNetUnfolderBase]: For 167/179 co-relation queries the response was YES. [2025-01-09 21:29:56,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6095 conditions, 4355 events. 365/4355 cut-off events. For 167/179 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 43006 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 4185. Up to 528 conditions per place. [2025-01-09 21:29:56,800 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-01-09 21:29:56,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 443 transitions, 1156 flow [2025-01-09 21:29:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:29:56,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:29:56,803 INFO L175 Difference]: Start difference. First operand has 445 places, 441 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:29:56,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 443 transitions, 1156 flow [2025-01-09 21:29:56,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 443 transitions, 1156 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:56,812 INFO L231 Difference]: Finished difference. Result has 446 places, 440 transitions, 1073 flow [2025-01-09 21:29:56,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=446, PETRI_TRANSITIONS=440} [2025-01-09 21:29:56,814 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -78 predicate places. [2025-01-09 21:29:56,815 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 440 transitions, 1073 flow [2025-01-09 21:29:56,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 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-01-09 21:29:56,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:56,816 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] [2025-01-09 21:29:56,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:29:56,816 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:56,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2026955868, now seen corresponding path program 1 times [2025-01-09 21:29:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113940874] [2025-01-09 21:29:56,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:56,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:56,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:29:56,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:29:56,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:56,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:56,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:56,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113940874] [2025-01-09 21:29:56,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113940874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:56,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:56,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:56,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303330219] [2025-01-09 21:29:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:56,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:56,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:56,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:56,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:56,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:29:56,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 440 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-01-09 21:29:56,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:56,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:29:56,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:57,990 INFO L124 PetriNetUnfolderBase]: 692/5707 cut-off events. [2025-01-09 21:29:57,990 INFO L125 PetriNetUnfolderBase]: For 586/594 co-relation queries the response was YES. [2025-01-09 21:29:58,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8572 conditions, 5707 events. 692/5707 cut-off events. For 586/594 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 60468 event pairs, 499 based on Foata normal form. 0/5179 useless extension candidates. Maximal degree in co-relation 8263. Up to 1234 conditions per place. [2025-01-09 21:29:58,099 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/442 dead transitions. [2025-01-09 21:29:58,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 442 transitions, 1156 flow [2025-01-09 21:29:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:29:58,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:29:58,103 INFO L175 Difference]: Start difference. First operand has 446 places, 440 transitions, 1073 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:29:58,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 442 transitions, 1156 flow [2025-01-09 21:29:58,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 442 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:58,116 INFO L231 Difference]: Finished difference. Result has 445 places, 439 transitions, 1071 flow [2025-01-09 21:29:58,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1071, PETRI_PLACES=445, PETRI_TRANSITIONS=439} [2025-01-09 21:29:58,118 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2025-01-09 21:29:58,118 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 439 transitions, 1071 flow [2025-01-09 21:29:58,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-01-09 21:29:58,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:58,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:29:58,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:58,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2132699351, now seen corresponding path program 1 times [2025-01-09 21:29:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039926835] [2025-01-09 21:29:58,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:29:58,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:29:58,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039926835] [2025-01-09 21:29:58,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039926835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:58,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370669776] [2025-01-09 21:29:58,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:58,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:58,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:29:58,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 439 transitions, 1071 flow. Second operand has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 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-01-09 21:29:58,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:58,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:29:58,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:59,228 INFO L124 PetriNetUnfolderBase]: 365/4331 cut-off events. [2025-01-09 21:29:59,228 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2025-01-09 21:29:59,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6096 conditions, 4331 events. 365/4331 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42628 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5064. Up to 528 conditions per place. [2025-01-09 21:29:59,364 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/441 dead transitions. [2025-01-09 21:29:59,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 441 transitions, 1156 flow [2025-01-09 21:29:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:29:59,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:29:59,367 INFO L175 Difference]: Start difference. First operand has 445 places, 439 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:29:59,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 441 transitions, 1156 flow [2025-01-09 21:29:59,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 441 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:59,379 INFO L231 Difference]: Finished difference. Result has 444 places, 438 transitions, 1069 flow [2025-01-09 21:29:59,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=444, PETRI_TRANSITIONS=438} [2025-01-09 21:29:59,380 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -80 predicate places. [2025-01-09 21:29:59,380 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 438 transitions, 1069 flow [2025-01-09 21:29:59,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 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-01-09 21:29:59,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:59,382 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] [2025-01-09 21:29:59,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:29:59,382 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:29:59,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash 624657986, now seen corresponding path program 1 times [2025-01-09 21:29:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430409932] [2025-01-09 21:29:59,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:59,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:29:59,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:29:59,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:59,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:59,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430409932] [2025-01-09 21:29:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430409932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:59,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:59,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:59,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720046552] [2025-01-09 21:29:59,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:59,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:59,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:59,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:59,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:29:59,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 438 transitions, 1069 flow. Second operand has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 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-01-09 21:29:59,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:59,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:29:59,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,359 INFO L124 PetriNetUnfolderBase]: 462/4381 cut-off events. [2025-01-09 21:30:00,359 INFO L125 PetriNetUnfolderBase]: For 474/477 co-relation queries the response was YES. [2025-01-09 21:30:00,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6384 conditions, 4381 events. 462/4381 cut-off events. For 474/477 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 43189 event pairs, 314 based on Foata normal form. 0/3978 useless extension candidates. Maximal degree in co-relation 6125. Up to 853 conditions per place. [2025-01-09 21:30:00,453 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/440 dead transitions. [2025-01-09 21:30:00,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1156 flow [2025-01-09 21:30:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:00,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:00,455 INFO L175 Difference]: Start difference. First operand has 444 places, 438 transitions, 1069 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:00,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1156 flow [2025-01-09 21:30:00,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 440 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:00,464 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 1067 flow [2025-01-09 21:30:00,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2025-01-09 21:30:00,466 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -81 predicate places. [2025-01-09 21:30:00,466 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 1067 flow [2025-01-09 21:30:00,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 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-01-09 21:30:00,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:00,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:00,467 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:00,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1357077277, now seen corresponding path program 1 times [2025-01-09 21:30:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868823787] [2025-01-09 21:30:00,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:30:00,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:30:00,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868823787] [2025-01-09 21:30:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868823787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:00,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:00,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:00,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647658611] [2025-01-09 21:30:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:00,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:00,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:00,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:00,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:00,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:00,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-01-09 21:30:00,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:00,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:00,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:01,886 INFO L124 PetriNetUnfolderBase]: 704/5884 cut-off events. [2025-01-09 21:30:01,887 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2025-01-09 21:30:01,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8825 conditions, 5884 events. 704/5884 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 62257 event pairs, 499 based on Foata normal form. 0/5374 useless extension candidates. Maximal degree in co-relation 7629. Up to 1234 conditions per place. [2025-01-09 21:30:01,995 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/439 dead transitions. [2025-01-09 21:30:01,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 439 transitions, 1150 flow [2025-01-09 21:30:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:01,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:01,997 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 1067 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:01,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 439 transitions, 1150 flow [2025-01-09 21:30:02,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 439 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:02,008 INFO L231 Difference]: Finished difference. Result has 442 places, 436 transitions, 1065 flow [2025-01-09 21:30:02,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1065, PETRI_PLACES=442, PETRI_TRANSITIONS=436} [2025-01-09 21:30:02,009 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -82 predicate places. [2025-01-09 21:30:02,009 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 436 transitions, 1065 flow [2025-01-09 21:30:02,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-01-09 21:30:02,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:02,011 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] [2025-01-09 21:30:02,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:02,011 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:02,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1563239762, now seen corresponding path program 1 times [2025-01-09 21:30:02,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:02,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313381859] [2025-01-09 21:30:02,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:02,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:02,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:30:02,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:30:02,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:02,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:02,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313381859] [2025-01-09 21:30:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313381859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:02,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:02,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:02,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014965831] [2025-01-09 21:30:02,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:02,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:02,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:02,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:02,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:02,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 436 transitions, 1065 flow. Second operand has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 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-01-09 21:30:02,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:02,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:02,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:02,905 INFO L124 PetriNetUnfolderBase]: 365/4294 cut-off events. [2025-01-09 21:30:02,905 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2025-01-09 21:30:02,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6059 conditions, 4294 events. 365/4294 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 42091 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5171. Up to 528 conditions per place. [2025-01-09 21:30:03,001 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/438 dead transitions. [2025-01-09 21:30:03,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 438 transitions, 1150 flow [2025-01-09 21:30:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:03,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:03,003 INFO L175 Difference]: Start difference. First operand has 442 places, 436 transitions, 1065 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:03,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 438 transitions, 1150 flow [2025-01-09 21:30:03,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 438 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:03,013 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 1063 flow [2025-01-09 21:30:03,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1063, PETRI_PLACES=441, PETRI_TRANSITIONS=435} [2025-01-09 21:30:03,014 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -83 predicate places. [2025-01-09 21:30:03,015 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 1063 flow [2025-01-09 21:30:03,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 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-01-09 21:30:03,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:03,016 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] [2025-01-09 21:30:03,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:03,016 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:03,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash -807163010, now seen corresponding path program 1 times [2025-01-09 21:30:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:03,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285936916] [2025-01-09 21:30:03,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:03,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:30:03,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:30:03,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:03,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285936916] [2025-01-09 21:30:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285936916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:03,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:03,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437846959] [2025-01-09 21:30:03,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:03,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:03,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:03,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:03,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:03,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:03,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 435 transitions, 1063 flow. Second operand has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 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-01-09 21:30:03,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:03,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:03,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:03,781 INFO L124 PetriNetUnfolderBase]: 235/3323 cut-off events. [2025-01-09 21:30:03,781 INFO L125 PetriNetUnfolderBase]: For 300/307 co-relation queries the response was YES. [2025-01-09 21:30:03,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4541 conditions, 3323 events. 235/3323 cut-off events. For 300/307 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 30256 event pairs, 129 based on Foata normal form. 1/3029 useless extension candidates. Maximal degree in co-relation 4326. Up to 435 conditions per place. [2025-01-09 21:30:03,839 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2025-01-09 21:30:03,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 437 transitions, 1146 flow [2025-01-09 21:30:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:03,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:03,841 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 1063 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:03,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 437 transitions, 1146 flow [2025-01-09 21:30:03,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 437 transitions, 1142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:03,846 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1061 flow [2025-01-09 21:30:03,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2025-01-09 21:30:03,847 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -84 predicate places. [2025-01-09 21:30:03,847 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1061 flow [2025-01-09 21:30:03,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 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-01-09 21:30:03,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:03,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:03,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:03,848 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:03,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1282323369, now seen corresponding path program 1 times [2025-01-09 21:30:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144399837] [2025-01-09 21:30:03,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:03,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:30:03,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:30:03,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:03,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:03,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:03,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144399837] [2025-01-09 21:30:03,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144399837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:03,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:03,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:03,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116543708] [2025-01-09 21:30:03,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:03,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:03,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:03,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:03,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:03,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:03,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-01-09 21:30:03,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:03,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:03,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:04,786 INFO L124 PetriNetUnfolderBase]: 462/4321 cut-off events. [2025-01-09 21:30:04,787 INFO L125 PetriNetUnfolderBase]: For 477/480 co-relation queries the response was YES. [2025-01-09 21:30:04,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6336 conditions, 4321 events. 462/4321 cut-off events. For 477/480 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 42455 event pairs, 314 based on Foata normal form. 0/3966 useless extension candidates. Maximal degree in co-relation 5565. Up to 853 conditions per place. [2025-01-09 21:30:04,879 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-01-09 21:30:04,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 1148 flow [2025-01-09 21:30:04,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:04,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:04,881 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1061 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:04,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 1148 flow [2025-01-09 21:30:04,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 436 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:04,887 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 1059 flow [2025-01-09 21:30:04,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=439, PETRI_TRANSITIONS=433} [2025-01-09 21:30:04,887 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -85 predicate places. [2025-01-09 21:30:04,888 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 1059 flow [2025-01-09 21:30:04,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-01-09 21:30:04,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:04,888 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] [2025-01-09 21:30:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:04,889 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:04,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash -733288568, now seen corresponding path program 1 times [2025-01-09 21:30:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:04,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52060943] [2025-01-09 21:30:04,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:04,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:30:04,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:30:04,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:04,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:04,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:04,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52060943] [2025-01-09 21:30:04,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52060943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:04,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:04,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534183492] [2025-01-09 21:30:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:04,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:04,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:04,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:05,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:05,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 433 transitions, 1059 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 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-01-09 21:30:05,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:05,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:06,205 INFO L124 PetriNetUnfolderBase]: 716/6041 cut-off events. [2025-01-09 21:30:06,205 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2025-01-09 21:30:06,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9036 conditions, 6041 events. 716/6041 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 63750 event pairs, 499 based on Foata normal form. 0/5569 useless extension candidates. Maximal degree in co-relation 8002. Up to 1234 conditions per place. [2025-01-09 21:30:06,358 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-01-09 21:30:06,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1142 flow [2025-01-09 21:30:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:06,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:06,361 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 1059 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:06,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1142 flow [2025-01-09 21:30:06,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 435 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:06,369 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 1057 flow [2025-01-09 21:30:06,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=438, PETRI_TRANSITIONS=432} [2025-01-09 21:30:06,370 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -86 predicate places. [2025-01-09 21:30:06,370 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 1057 flow [2025-01-09 21:30:06,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 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-01-09 21:30:06,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:06,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:06,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:06,371 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:06,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1609729219, now seen corresponding path program 1 times [2025-01-09 21:30:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637724643] [2025-01-09 21:30:06,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:06,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:30:06,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:30:06,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:06,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:06,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:06,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637724643] [2025-01-09 21:30:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637724643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:06,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:06,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135480101] [2025-01-09 21:30:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:06,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:06,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:06,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:06,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:06,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:06,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 432 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 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-01-09 21:30:06,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:06,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:06,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,252 INFO L124 PetriNetUnfolderBase]: 365/4246 cut-off events. [2025-01-09 21:30:07,252 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2025-01-09 21:30:07,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6011 conditions, 4246 events. 365/4246 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 41482 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5267. Up to 528 conditions per place. [2025-01-09 21:30:07,340 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-01-09 21:30:07,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 434 transitions, 1142 flow [2025-01-09 21:30:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:07,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:07,343 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 1057 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:07,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 434 transitions, 1142 flow [2025-01-09 21:30:07,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:07,350 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 1055 flow [2025-01-09 21:30:07,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1055, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-01-09 21:30:07,351 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -87 predicate places. [2025-01-09 21:30:07,351 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 1055 flow [2025-01-09 21:30:07,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 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-01-09 21:30:07,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:07,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:07,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:07,353 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread4Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:07,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1915820795, now seen corresponding path program 1 times [2025-01-09 21:30:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:07,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239604753] [2025-01-09 21:30:07,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:07,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:30:07,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:30:07,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:07,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239604753] [2025-01-09 21:30:07,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239604753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:07,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69128991] [2025-01-09 21:30:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:07,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:07,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:07,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:07,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:07,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 1055 flow. Second operand has 3 states, 3 states have (on average 507.6666666666667) internal successors, (1523), 3 states have internal predecessors, (1523), 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-01-09 21:30:07,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:07,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:07,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,982 INFO L124 PetriNetUnfolderBase]: 235/3321 cut-off events. [2025-01-09 21:30:07,982 INFO L125 PetriNetUnfolderBase]: For 300/304 co-relation queries the response was YES. [2025-01-09 21:30:08,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 3321 events. 235/3321 cut-off events. For 300/304 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 30064 event pairs, 129 based on Foata normal form. 0/3058 useless extension candidates. Maximal degree in co-relation 4360. Up to 435 conditions per place. [2025-01-09 21:30:08,038 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-01-09 21:30:08,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 433 transitions, 1138 flow [2025-01-09 21:30:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:08,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:08,040 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 1055 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:08,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 433 transitions, 1138 flow [2025-01-09 21:30:08,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 433 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:08,046 INFO L231 Difference]: Finished difference. Result has 436 places, 430 transitions, 1053 flow [2025-01-09 21:30:08,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=436, PETRI_TRANSITIONS=430} [2025-01-09 21:30:08,046 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -88 predicate places. [2025-01-09 21:30:08,047 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 430 transitions, 1053 flow [2025-01-09 21:30:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.6666666666667) internal successors, (1523), 3 states have internal predecessors, (1523), 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-01-09 21:30:08,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:08,047 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] [2025-01-09 21:30:08,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:08,047 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:08,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1374189586, now seen corresponding path program 1 times [2025-01-09 21:30:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564860335] [2025-01-09 21:30:08,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:08,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 21:30:08,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 21:30:08,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:08,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564860335] [2025-01-09 21:30:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564860335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404259985] [2025-01-09 21:30:08,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:08,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:08,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:08,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:08,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:08,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 430 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-01-09 21:30:08,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:08,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:08,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:08,865 INFO L124 PetriNetUnfolderBase]: 462/4261 cut-off events. [2025-01-09 21:30:08,865 INFO L125 PetriNetUnfolderBase]: For 474/477 co-relation queries the response was YES. [2025-01-09 21:30:08,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6276 conditions, 4261 events. 462/4261 cut-off events. For 474/477 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 41536 event pairs, 314 based on Foata normal form. 0/3954 useless extension candidates. Maximal degree in co-relation 5613. Up to 853 conditions per place. [2025-01-09 21:30:08,944 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-01-09 21:30:08,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 432 transitions, 1140 flow [2025-01-09 21:30:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:08,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:08,948 INFO L175 Difference]: Start difference. First operand has 436 places, 430 transitions, 1053 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:08,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 432 transitions, 1140 flow [2025-01-09 21:30:08,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 432 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:08,955 INFO L231 Difference]: Finished difference. Result has 435 places, 429 transitions, 1051 flow [2025-01-09 21:30:08,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=435, PETRI_TRANSITIONS=429} [2025-01-09 21:30:08,955 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -89 predicate places. [2025-01-09 21:30:08,955 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 429 transitions, 1051 flow [2025-01-09 21:30:08,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-01-09 21:30:08,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:08,956 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] [2025-01-09 21:30:08,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:08,956 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:08,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:08,956 INFO L85 PathProgramCache]: Analyzing trace with hash -620094071, now seen corresponding path program 1 times [2025-01-09 21:30:08,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:08,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677036957] [2025-01-09 21:30:08,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:08,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:08,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:08,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:08,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:08,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:08,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677036957] [2025-01-09 21:30:08,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677036957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:08,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:08,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:08,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296249610] [2025-01-09 21:30:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:08,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:08,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:08,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:09,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:09,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 429 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-01-09 21:30:09,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:09,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:09,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:10,124 INFO L124 PetriNetUnfolderBase]: 728/6192 cut-off events. [2025-01-09 21:30:10,124 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2025-01-09 21:30:10,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9241 conditions, 6192 events. 728/6192 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 64847 event pairs, 499 based on Foata normal form. 0/5764 useless extension candidates. Maximal degree in co-relation 8369. Up to 1234 conditions per place. [2025-01-09 21:30:10,287 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2025-01-09 21:30:10,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 431 transitions, 1134 flow [2025-01-09 21:30:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:10,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:10,289 INFO L175 Difference]: Start difference. First operand has 435 places, 429 transitions, 1051 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:10,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 431 transitions, 1134 flow [2025-01-09 21:30:10,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 431 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:10,297 INFO L231 Difference]: Finished difference. Result has 434 places, 428 transitions, 1049 flow [2025-01-09 21:30:10,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=428} [2025-01-09 21:30:10,299 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -90 predicate places. [2025-01-09 21:30:10,299 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 428 transitions, 1049 flow [2025-01-09 21:30:10,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-01-09 21:30:10,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:10,300 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] [2025-01-09 21:30:10,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:30:10,300 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash 646929498, now seen corresponding path program 1 times [2025-01-09 21:30:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409397686] [2025-01-09 21:30:10,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:10,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:30:10,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:30:10,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:10,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409397686] [2025-01-09 21:30:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409397686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:10,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240196425] [2025-01-09 21:30:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:10,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:10,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:10,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:10,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 428 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 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-01-09 21:30:10,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:10,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:10,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:11,066 INFO L124 PetriNetUnfolderBase]: 365/4198 cut-off events. [2025-01-09 21:30:11,066 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2025-01-09 21:30:11,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5963 conditions, 4198 events. 365/4198 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 40755 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5363. Up to 528 conditions per place. [2025-01-09 21:30:11,150 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/430 dead transitions. [2025-01-09 21:30:11,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 430 transitions, 1134 flow [2025-01-09 21:30:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:11,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:11,153 INFO L175 Difference]: Start difference. First operand has 434 places, 428 transitions, 1049 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:11,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 430 transitions, 1134 flow [2025-01-09 21:30:11,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 430 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:11,159 INFO L231 Difference]: Finished difference. Result has 433 places, 427 transitions, 1047 flow [2025-01-09 21:30:11,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1047, PETRI_PLACES=433, PETRI_TRANSITIONS=427} [2025-01-09 21:30:11,160 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -91 predicate places. [2025-01-09 21:30:11,160 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 427 transitions, 1047 flow [2025-01-09 21:30:11,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 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-01-09 21:30:11,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:11,161 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] [2025-01-09 21:30:11,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:30:11,161 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread4Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:11,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1742486998, now seen corresponding path program 1 times [2025-01-09 21:30:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089199521] [2025-01-09 21:30:11,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:11,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:30:11,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:30:11,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:11,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:11,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:11,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089199521] [2025-01-09 21:30:11,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089199521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:11,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:11,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:11,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066078401] [2025-01-09 21:30:11,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:11,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:11,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:11,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:11,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:11,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:11,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 427 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 508.6666666666667) internal successors, (1526), 3 states have internal predecessors, (1526), 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-01-09 21:30:11,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:11,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:11,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:11,783 INFO L124 PetriNetUnfolderBase]: 235/3277 cut-off events. [2025-01-09 21:30:11,783 INFO L125 PetriNetUnfolderBase]: For 299/303 co-relation queries the response was YES. [2025-01-09 21:30:11,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4495 conditions, 3277 events. 235/3277 cut-off events. For 299/303 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 29605 event pairs, 129 based on Foata normal form. 0/3052 useless extension candidates. Maximal degree in co-relation 4352. Up to 435 conditions per place. [2025-01-09 21:30:11,844 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2025-01-09 21:30:11,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 429 transitions, 1130 flow [2025-01-09 21:30:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:11,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:11,847 INFO L175 Difference]: Start difference. First operand has 433 places, 427 transitions, 1047 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:11,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 429 transitions, 1130 flow [2025-01-09 21:30:11,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 429 transitions, 1126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:11,852 INFO L231 Difference]: Finished difference. Result has 432 places, 426 transitions, 1045 flow [2025-01-09 21:30:11,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=432, PETRI_TRANSITIONS=426} [2025-01-09 21:30:11,854 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -92 predicate places. [2025-01-09 21:30:11,854 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 426 transitions, 1045 flow [2025-01-09 21:30:11,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.6666666666667) internal successors, (1526), 3 states have internal predecessors, (1526), 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-01-09 21:30:11,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:11,854 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] [2025-01-09 21:30:11,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:30:11,855 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1871945661, now seen corresponding path program 1 times [2025-01-09 21:30:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646172133] [2025-01-09 21:30:11,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:11,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:30:11,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:30:11,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:11,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:11,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646172133] [2025-01-09 21:30:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646172133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:11,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:11,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5914780] [2025-01-09 21:30:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:11,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:11,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:11,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:11,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:11,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 426 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 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-01-09 21:30:11,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:11,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:11,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:12,688 INFO L124 PetriNetUnfolderBase]: 462/4201 cut-off events. [2025-01-09 21:30:12,688 INFO L125 PetriNetUnfolderBase]: For 471/474 co-relation queries the response was YES. [2025-01-09 21:30:12,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6216 conditions, 4201 events. 462/4201 cut-off events. For 471/474 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 40939 event pairs, 314 based on Foata normal form. 0/3942 useless extension candidates. Maximal degree in co-relation 5661. Up to 853 conditions per place. [2025-01-09 21:30:12,799 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2025-01-09 21:30:12,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 428 transitions, 1132 flow [2025-01-09 21:30:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:12,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:12,801 INFO L175 Difference]: Start difference. First operand has 432 places, 426 transitions, 1045 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:12,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 428 transitions, 1132 flow [2025-01-09 21:30:12,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 428 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:12,807 INFO L231 Difference]: Finished difference. Result has 431 places, 425 transitions, 1043 flow [2025-01-09 21:30:12,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=431, PETRI_TRANSITIONS=425} [2025-01-09 21:30:12,808 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -93 predicate places. [2025-01-09 21:30:12,808 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 425 transitions, 1043 flow [2025-01-09 21:30:12,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 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-01-09 21:30:12,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:12,809 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] [2025-01-09 21:30:12,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:30:12,809 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:12,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash -821554508, now seen corresponding path program 1 times [2025-01-09 21:30:12,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:12,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197520380] [2025-01-09 21:30:12,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:12,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:12,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 21:30:12,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 21:30:12,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:12,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:12,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:12,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197520380] [2025-01-09 21:30:12,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197520380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:12,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:12,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690240618] [2025-01-09 21:30:12,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:12,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:12,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:12,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:12,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:12,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 425 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-01-09 21:30:12,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:12,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:12,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:14,077 INFO L124 PetriNetUnfolderBase]: 740/6337 cut-off events. [2025-01-09 21:30:14,077 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2025-01-09 21:30:14,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9440 conditions, 6337 events. 740/6337 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 65690 event pairs, 499 based on Foata normal form. 0/5962 useless extension candidates. Maximal degree in co-relation 8730. Up to 1234 conditions per place. [2025-01-09 21:30:14,229 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2025-01-09 21:30:14,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 427 transitions, 1126 flow [2025-01-09 21:30:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:14,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:14,231 INFO L175 Difference]: Start difference. First operand has 431 places, 425 transitions, 1043 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:14,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 427 transitions, 1126 flow [2025-01-09 21:30:14,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 427 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:14,241 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 1041 flow [2025-01-09 21:30:14,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-01-09 21:30:14,242 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -94 predicate places. [2025-01-09 21:30:14,242 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 1041 flow [2025-01-09 21:30:14,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-01-09 21:30:14,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:14,243 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] [2025-01-09 21:30:14,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:30:14,243 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:14,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash 914167983, now seen corresponding path program 1 times [2025-01-09 21:30:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:14,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017743051] [2025-01-09 21:30:14,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:14,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:14,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:30:14,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:30:14,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:14,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017743051] [2025-01-09 21:30:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017743051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:14,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:14,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:14,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952260719] [2025-01-09 21:30:14,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:14,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:14,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:14,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:14,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:14,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:14,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 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-01-09 21:30:14,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:14,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:14,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:14,922 INFO L124 PetriNetUnfolderBase]: 365/4150 cut-off events. [2025-01-09 21:30:14,923 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2025-01-09 21:30:14,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5915 conditions, 4150 events. 365/4150 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 40100 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5459. Up to 528 conditions per place. [2025-01-09 21:30:15,008 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2025-01-09 21:30:15,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 426 transitions, 1126 flow [2025-01-09 21:30:15,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:15,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:15,010 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 1041 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:15,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 426 transitions, 1126 flow [2025-01-09 21:30:15,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 426 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:15,017 INFO L231 Difference]: Finished difference. Result has 429 places, 423 transitions, 1039 flow [2025-01-09 21:30:15,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=429, PETRI_TRANSITIONS=423} [2025-01-09 21:30:15,018 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -95 predicate places. [2025-01-09 21:30:15,018 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 423 transitions, 1039 flow [2025-01-09 21:30:15,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 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-01-09 21:30:15,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:15,019 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] [2025-01-09 21:30:15,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:30:15,019 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread4Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:15,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 644856295, now seen corresponding path program 1 times [2025-01-09 21:30:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344408912] [2025-01-09 21:30:15,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:15,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:30:15,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:30:15,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:15,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:15,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:15,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344408912] [2025-01-09 21:30:15,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344408912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:15,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:15,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:15,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949144856] [2025-01-09 21:30:15,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:15,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:15,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:15,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:15,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:15,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 423 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 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-01-09 21:30:15,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:15,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:15,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:15,581 INFO L124 PetriNetUnfolderBase]: 235/3233 cut-off events. [2025-01-09 21:30:15,581 INFO L125 PetriNetUnfolderBase]: For 299/303 co-relation queries the response was YES. [2025-01-09 21:30:15,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4451 conditions, 3233 events. 235/3233 cut-off events. For 299/303 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 29009 event pairs, 129 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 4344. Up to 435 conditions per place. [2025-01-09 21:30:15,639 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2025-01-09 21:30:15,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 1122 flow [2025-01-09 21:30:15,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:15,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:15,642 INFO L175 Difference]: Start difference. First operand has 429 places, 423 transitions, 1039 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:15,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 1122 flow [2025-01-09 21:30:15,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 425 transitions, 1118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:15,647 INFO L231 Difference]: Finished difference. Result has 428 places, 422 transitions, 1037 flow [2025-01-09 21:30:15,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1037, PETRI_PLACES=428, PETRI_TRANSITIONS=422} [2025-01-09 21:30:15,648 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -96 predicate places. [2025-01-09 21:30:15,648 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 422 transitions, 1037 flow [2025-01-09 21:30:15,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 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-01-09 21:30:15,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:15,649 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] [2025-01-09 21:30:15,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:30:15,649 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:15,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2111565414, now seen corresponding path program 1 times [2025-01-09 21:30:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421463176] [2025-01-09 21:30:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:15,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 21:30:15,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 21:30:15,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:15,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421463176] [2025-01-09 21:30:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421463176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:15,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385689830] [2025-01-09 21:30:15,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:15,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:15,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:15,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:15,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 422 transitions, 1037 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-01-09 21:30:15,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:15,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:15,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:16,364 INFO L124 PetriNetUnfolderBase]: 462/4141 cut-off events. [2025-01-09 21:30:16,364 INFO L125 PetriNetUnfolderBase]: For 468/471 co-relation queries the response was YES. [2025-01-09 21:30:16,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6156 conditions, 4141 events. 462/4141 cut-off events. For 468/471 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 39983 event pairs, 314 based on Foata normal form. 0/3930 useless extension candidates. Maximal degree in co-relation 5709. Up to 853 conditions per place. [2025-01-09 21:30:16,451 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2025-01-09 21:30:16,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 424 transitions, 1124 flow [2025-01-09 21:30:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:16,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:16,453 INFO L175 Difference]: Start difference. First operand has 428 places, 422 transitions, 1037 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:16,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 424 transitions, 1124 flow [2025-01-09 21:30:16,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 424 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:16,460 INFO L231 Difference]: Finished difference. Result has 427 places, 421 transitions, 1035 flow [2025-01-09 21:30:16,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1035, PETRI_PLACES=427, PETRI_TRANSITIONS=421} [2025-01-09 21:30:16,460 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -97 predicate places. [2025-01-09 21:30:16,460 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 421 transitions, 1035 flow [2025-01-09 21:30:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-01-09 21:30:16,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:16,461 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-01-09 21:30:16,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:30:16,461 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:16,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1157974027, now seen corresponding path program 1 times [2025-01-09 21:30:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278743020] [2025-01-09 21:30:16,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:16,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 21:30:16,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 21:30:16,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:16,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:16,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:16,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278743020] [2025-01-09 21:30:16,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278743020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:16,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:16,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:16,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694257136] [2025-01-09 21:30:16,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:16,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:16,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:16,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:16,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:16,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:16,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 421 transitions, 1035 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-01-09 21:30:16,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:16,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:16,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:17,589 INFO L124 PetriNetUnfolderBase]: 752/6476 cut-off events. [2025-01-09 21:30:17,589 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2025-01-09 21:30:17,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9633 conditions, 6476 events. 752/6476 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 66473 event pairs, 499 based on Foata normal form. 0/6160 useless extension candidates. Maximal degree in co-relation 9085. Up to 1234 conditions per place. [2025-01-09 21:30:17,723 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-01-09 21:30:17,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 423 transitions, 1118 flow [2025-01-09 21:30:17,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:17,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:17,726 INFO L175 Difference]: Start difference. First operand has 427 places, 421 transitions, 1035 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:17,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 423 transitions, 1118 flow [2025-01-09 21:30:17,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 423 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:17,732 INFO L231 Difference]: Finished difference. Result has 426 places, 420 transitions, 1033 flow [2025-01-09 21:30:17,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=426, PETRI_TRANSITIONS=420} [2025-01-09 21:30:17,733 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -98 predicate places. [2025-01-09 21:30:17,733 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 420 transitions, 1033 flow [2025-01-09 21:30:17,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-01-09 21:30:17,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:17,734 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] [2025-01-09 21:30:17,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:30:17,734 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:17,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 777807366, now seen corresponding path program 1 times [2025-01-09 21:30:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:17,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713283256] [2025-01-09 21:30:17,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:17,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:17,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:30:17,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:30:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713283256] [2025-01-09 21:30:17,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713283256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:17,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:17,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775165987] [2025-01-09 21:30:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:17,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:17,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:17,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:17,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:17,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 420 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 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-01-09 21:30:17,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:17,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:17,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,373 INFO L124 PetriNetUnfolderBase]: 365/4102 cut-off events. [2025-01-09 21:30:18,373 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2025-01-09 21:30:18,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5867 conditions, 4102 events. 365/4102 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39417 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5555. Up to 528 conditions per place. [2025-01-09 21:30:18,453 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-01-09 21:30:18,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 1118 flow [2025-01-09 21:30:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:18,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:18,456 INFO L175 Difference]: Start difference. First operand has 426 places, 420 transitions, 1033 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:18,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 1118 flow [2025-01-09 21:30:18,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 422 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:18,462 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 1031 flow [2025-01-09 21:30:18,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2025-01-09 21:30:18,463 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -99 predicate places. [2025-01-09 21:30:18,463 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 1031 flow [2025-01-09 21:30:18,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 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-01-09 21:30:18,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,463 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] [2025-01-09 21:30:18,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:30:18,464 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread4Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:18,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash 345579734, now seen corresponding path program 1 times [2025-01-09 21:30:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748168253] [2025-01-09 21:30:18,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:30:18,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:30:18,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:18,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748168253] [2025-01-09 21:30:18,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748168253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382365127] [2025-01-09 21:30:18,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:18,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:18,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:18,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:18,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 510.6666666666667) internal successors, (1532), 3 states have internal predecessors, (1532), 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-01-09 21:30:18,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:18,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,032 INFO L124 PetriNetUnfolderBase]: 235/3189 cut-off events. [2025-01-09 21:30:19,032 INFO L125 PetriNetUnfolderBase]: For 299/303 co-relation queries the response was YES. [2025-01-09 21:30:19,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4407 conditions, 3189 events. 235/3189 cut-off events. For 299/303 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 28504 event pairs, 129 based on Foata normal form. 0/3040 useless extension candidates. Maximal degree in co-relation 4336. Up to 435 conditions per place. [2025-01-09 21:30:19,092 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/421 dead transitions. [2025-01-09 21:30:19,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 421 transitions, 1114 flow [2025-01-09 21:30:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:19,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:19,094 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 1031 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:19,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 421 transitions, 1114 flow [2025-01-09 21:30:19,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 421 transitions, 1110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:19,102 INFO L231 Difference]: Finished difference. Result has 424 places, 418 transitions, 1029 flow [2025-01-09 21:30:19,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=424, PETRI_TRANSITIONS=418} [2025-01-09 21:30:19,103 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -100 predicate places. [2025-01-09 21:30:19,103 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 418 transitions, 1029 flow [2025-01-09 21:30:19,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.6666666666667) internal successors, (1532), 3 states have internal predecessors, (1532), 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-01-09 21:30:19,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,104 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] [2025-01-09 21:30:19,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:30:19,104 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1137710033, now seen corresponding path program 1 times [2025-01-09 21:30:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896844388] [2025-01-09 21:30:19,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:19,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:19,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:30:19,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:30:19,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:19,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:19,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:19,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896844388] [2025-01-09 21:30:19,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896844388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:19,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:19,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516960103] [2025-01-09 21:30:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:19,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:19,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:19,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:19,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:19,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 418 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-01-09 21:30:19,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:19,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:19,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,873 INFO L124 PetriNetUnfolderBase]: 462/4081 cut-off events. [2025-01-09 21:30:19,873 INFO L125 PetriNetUnfolderBase]: For 465/468 co-relation queries the response was YES. [2025-01-09 21:30:19,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6096 conditions, 4081 events. 462/4081 cut-off events. For 465/468 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 39137 event pairs, 314 based on Foata normal form. 0/3918 useless extension candidates. Maximal degree in co-relation 5757. Up to 853 conditions per place. [2025-01-09 21:30:19,932 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2025-01-09 21:30:19,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1116 flow [2025-01-09 21:30:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:19,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:19,933 INFO L175 Difference]: Start difference. First operand has 424 places, 418 transitions, 1029 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:19,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1116 flow [2025-01-09 21:30:19,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 420 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:19,940 INFO L231 Difference]: Finished difference. Result has 423 places, 417 transitions, 1027 flow [2025-01-09 21:30:19,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1027, PETRI_PLACES=423, PETRI_TRANSITIONS=417} [2025-01-09 21:30:19,940 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -101 predicate places. [2025-01-09 21:30:19,940 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 417 transitions, 1027 flow [2025-01-09 21:30:19,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-01-09 21:30:19,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,941 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] [2025-01-09 21:30:19,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:30:19,941 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:19,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash -577870368, now seen corresponding path program 1 times [2025-01-09 21:30:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342702099] [2025-01-09 21:30:19,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:19,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:30:19,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:30:19,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:19,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342702099] [2025-01-09 21:30:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342702099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718217078] [2025-01-09 21:30:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:19,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:19,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:19,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:20,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:20,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 417 transitions, 1027 flow. Second operand has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 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-01-09 21:30:20,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:20,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:20,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:21,123 INFO L124 PetriNetUnfolderBase]: 764/6609 cut-off events. [2025-01-09 21:30:21,123 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2025-01-09 21:30:21,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9820 conditions, 6609 events. 764/6609 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 67183 event pairs, 499 based on Foata normal form. 0/6362 useless extension candidates. Maximal degree in co-relation 9434. Up to 1234 conditions per place. [2025-01-09 21:30:21,289 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2025-01-09 21:30:21,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 419 transitions, 1110 flow [2025-01-09 21:30:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:21,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:21,290 INFO L175 Difference]: Start difference. First operand has 423 places, 417 transitions, 1027 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:21,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 419 transitions, 1110 flow [2025-01-09 21:30:21,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 419 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:21,298 INFO L231 Difference]: Finished difference. Result has 422 places, 416 transitions, 1025 flow [2025-01-09 21:30:21,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=420, 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=1025, PETRI_PLACES=422, PETRI_TRANSITIONS=416} [2025-01-09 21:30:21,299 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -102 predicate places. [2025-01-09 21:30:21,299 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 416 transitions, 1025 flow [2025-01-09 21:30:21,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 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-01-09 21:30:21,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:21,300 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] [2025-01-09 21:30:21,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:30:21,300 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread4Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:21,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1175842605, now seen corresponding path program 1 times [2025-01-09 21:30:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:21,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213621518] [2025-01-09 21:30:21,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:21,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 21:30:21,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:30:21,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:21,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213621518] [2025-01-09 21:30:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213621518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670468570] [2025-01-09 21:30:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:21,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:21,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:21,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 416 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 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-01-09 21:30:21,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:21,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:21,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:21,864 INFO L124 PetriNetUnfolderBase]: 235/3148 cut-off events. [2025-01-09 21:30:21,864 INFO L125 PetriNetUnfolderBase]: For 308/312 co-relation queries the response was YES. [2025-01-09 21:30:21,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4384 conditions, 3148 events. 235/3148 cut-off events. For 308/312 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 28001 event pairs, 129 based on Foata normal form. 0/3034 useless extension candidates. Maximal degree in co-relation 4226. Up to 435 conditions per place. [2025-01-09 21:30:21,920 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2025-01-09 21:30:21,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 418 transitions, 1108 flow [2025-01-09 21:30:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:21,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:21,922 INFO L175 Difference]: Start difference. First operand has 422 places, 416 transitions, 1025 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:21,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 418 transitions, 1108 flow [2025-01-09 21:30:21,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 418 transitions, 1104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:21,927 INFO L231 Difference]: Finished difference. Result has 421 places, 415 transitions, 1023 flow [2025-01-09 21:30:21,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=421, PETRI_TRANSITIONS=415} [2025-01-09 21:30:21,928 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -103 predicate places. [2025-01-09 21:30:21,928 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 415 transitions, 1023 flow [2025-01-09 21:30:21,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 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-01-09 21:30:21,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:21,929 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] [2025-01-09 21:30:21,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:30:21,929 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:21,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1185995962, now seen corresponding path program 1 times [2025-01-09 21:30:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:21,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963387557] [2025-01-09 21:30:21,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:21,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 21:30:21,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 21:30:21,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:21,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963387557] [2025-01-09 21:30:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963387557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601811190] [2025-01-09 21:30:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:21,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:22,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-01-09 21:30:22,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 415 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-01-09 21:30:22,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-01-09 21:30:22,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,620 INFO L124 PetriNetUnfolderBase]: 462/4024 cut-off events. [2025-01-09 21:30:22,620 INFO L125 PetriNetUnfolderBase]: For 462/465 co-relation queries the response was YES. [2025-01-09 21:30:22,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 4024 events. 462/4024 cut-off events. For 462/465 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 38392 event pairs, 314 based on Foata normal form. 0/3906 useless extension candidates. Maximal degree in co-relation 5808. Up to 853 conditions per place. [2025-01-09 21:30:22,684 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2025-01-09 21:30:22,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 417 transitions, 1110 flow [2025-01-09 21:30:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-01-09 21:30:22,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-01-09 21:30:22,685 INFO L175 Difference]: Start difference. First operand has 421 places, 415 transitions, 1023 flow. Second operand 3 states and 1545 transitions. [2025-01-09 21:30:22,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 417 transitions, 1110 flow [2025-01-09 21:30:22,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:22,690 INFO L231 Difference]: Finished difference. Result has 420 places, 414 transitions, 1021 flow [2025-01-09 21:30:22,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=420, PETRI_TRANSITIONS=414} [2025-01-09 21:30:22,691 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -104 predicate places. [2025-01-09 21:30:22,691 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 414 transitions, 1021 flow [2025-01-09 21:30:22,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-01-09 21:30:22,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,691 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] [2025-01-09 21:30:22,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 21:30:22,691 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread4Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-01-09 21:30:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1837221762, now seen corresponding path program 1 times [2025-01-09 21:30:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509112503] [2025-01-09 21:30:22,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 21:30:22,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 21:30:22,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509112503] [2025-01-09 21:30:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509112503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:22,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:22,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:22,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825292666] [2025-01-09 21:30:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:22,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:22,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:22,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:22,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-01-09 21:30:22,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 414 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 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-01-09 21:30:22,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-01-09 21:30:22,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,222 INFO L124 PetriNetUnfolderBase]: 235/3119 cut-off events. [2025-01-09 21:30:23,222 INFO L125 PetriNetUnfolderBase]: For 307/311 co-relation queries the response was YES. [2025-01-09 21:30:23,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4353 conditions, 3119 events. 235/3119 cut-off events. For 307/311 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 27598 event pairs, 129 based on Foata normal form. 0/3028 useless extension candidates. Maximal degree in co-relation 4214. Up to 435 conditions per place. [2025-01-09 21:30:23,268 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 0 selfloop transitions, 0 changer transitions 416/416 dead transitions. [2025-01-09 21:30:23,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 416 transitions, 1104 flow [2025-01-09 21:30:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:30:23,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-01-09 21:30:23,270 INFO L175 Difference]: Start difference. First operand has 420 places, 414 transitions, 1021 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:30:23,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 416 transitions, 1104 flow [2025-01-09 21:30:23,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 416 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:23,274 INFO L231 Difference]: Finished difference. Result has 419 places, 0 transitions, 0 flow [2025-01-09 21:30:23,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=419, PETRI_TRANSITIONS=0} [2025-01-09 21:30:23,274 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -105 predicate places. [2025-01-09 21:30:23,274 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 0 transitions, 0 flow [2025-01-09 21:30:23,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 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-01-09 21:30:23,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (202 of 203 remaining) [2025-01-09 21:30:23,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (201 of 203 remaining) [2025-01-09 21:30:23,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (200 of 203 remaining) [2025-01-09 21:30:23,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (199 of 203 remaining) [2025-01-09 21:30:23,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (198 of 203 remaining) [2025-01-09 21:30:23,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (197 of 203 remaining) [2025-01-09 21:30:23,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (196 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (195 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (194 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (193 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (192 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (191 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (190 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (189 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (188 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (187 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (186 of 203 remaining) [2025-01-09 21:30:23,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (185 of 203 remaining) [2025-01-09 21:30:23,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (184 of 203 remaining) [2025-01-09 21:30:23,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (183 of 203 remaining) [2025-01-09 21:30:23,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (182 of 203 remaining) [2025-01-09 21:30:23,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (181 of 203 remaining) [2025-01-09 21:30:23,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (180 of 203 remaining) [2025-01-09 21:30:23,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (179 of 203 remaining) [2025-01-09 21:30:23,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (178 of 203 remaining) [2025-01-09 21:30:23,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (177 of 203 remaining) [2025-01-09 21:30:23,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (176 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (175 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (174 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (173 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (172 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (171 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (170 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (169 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (168 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (167 of 203 remaining) [2025-01-09 21:30:23,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (166 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (165 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (164 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (163 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (162 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (161 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (160 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (159 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (158 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (157 of 203 remaining) [2025-01-09 21:30:23,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (156 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (155 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (154 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (153 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (152 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (151 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (150 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (149 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (148 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (147 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (146 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (145 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (144 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (143 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (142 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (141 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (140 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (139 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (138 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (137 of 203 remaining) [2025-01-09 21:30:23,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (136 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (135 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (134 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (133 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (132 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (131 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (130 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (129 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (128 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (127 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (126 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (125 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (124 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (123 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (122 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (121 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (120 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (119 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (118 of 203 remaining) [2025-01-09 21:30:23,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (117 of 203 remaining) [2025-01-09 21:30:23,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (116 of 203 remaining) [2025-01-09 21:30:23,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (115 of 203 remaining) [2025-01-09 21:30:23,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (114 of 203 remaining) [2025-01-09 21:30:23,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (113 of 203 remaining) [2025-01-09 21:30:23,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (112 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (111 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (110 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (109 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (108 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (107 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (106 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (105 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (104 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (103 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (102 of 203 remaining) [2025-01-09 21:30:23,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (101 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (100 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (99 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (98 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (97 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (96 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (95 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (94 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (93 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (92 of 203 remaining) [2025-01-09 21:30:23,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (91 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (90 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (89 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (88 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (87 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (86 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (85 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (84 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (83 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (82 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (81 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (80 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (79 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (78 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (77 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (76 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (75 of 203 remaining) [2025-01-09 21:30:23,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (74 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (73 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (72 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (71 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (70 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (69 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (68 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (66 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (65 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (64 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (63 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (62 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (59 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (58 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (57 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (56 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (55 of 203 remaining) [2025-01-09 21:30:23,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (54 of 203 remaining) [2025-01-09 21:30:23,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (53 of 203 remaining) [2025-01-09 21:30:23,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (52 of 203 remaining) [2025-01-09 21:30:23,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (51 of 203 remaining) [2025-01-09 21:30:23,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (50 of 203 remaining) [2025-01-09 21:30:23,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (49 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (48 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (47 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (46 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (44 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (43 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (41 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (40 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (39 of 203 remaining) [2025-01-09 21:30:23,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (38 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (37 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (36 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (35 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (34 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (33 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (32 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (31 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (30 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (29 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (28 of 203 remaining) [2025-01-09 21:30:23,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (27 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (26 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (25 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (24 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (23 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (22 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (21 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (20 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (19 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (18 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (17 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (16 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (15 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (14 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (13 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (12 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (10 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (9 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (8 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (7 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (6 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (5 of 203 remaining) [2025-01-09 21:30:23,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (4 of 203 remaining) [2025-01-09 21:30:23,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (3 of 203 remaining) [2025-01-09 21:30:23,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (2 of 203 remaining) [2025-01-09 21:30:23,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (1 of 203 remaining) [2025-01-09 21:30:23,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (0 of 203 remaining) [2025-01-09 21:30:23,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 21:30:23,294 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:23,302 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:23,302 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:23,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:23 BasicIcfg [2025-01-09 21:30:23,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:23,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:23,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:23,311 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:23,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:47" (3/4) ... [2025-01-09 21:30:23,313 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:23,315 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:23,315 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:23,315 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:30:23,316 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:30:23,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-09 21:30:23,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:23,320 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:30:23,320 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:23,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:23,404 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:23,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:23,405 INFO L158 Benchmark]: Toolchain (without parser) took 36581.98ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 133.4MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 815.3MB. Max. memory is 16.1GB. [2025-01-09 21:30:23,406 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:23,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.51ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 120.0MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:23,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.52ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:23,408 INFO L158 Benchmark]: Boogie Preprocessor took 32.54ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 117.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:23,408 INFO L158 Benchmark]: RCFGBuilder took 814.04ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 85.1MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:30:23,408 INFO L158 Benchmark]: TraceAbstraction took 35325.24ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 84.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 756.6MB. Max. memory is 16.1GB. [2025-01-09 21:30:23,409 INFO L158 Benchmark]: Witness Printer took 93.44ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:23,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.51ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 120.0MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.52ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.54ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 117.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 814.04ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 85.1MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35325.24ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 84.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 756.6MB. Max. memory is 16.1GB. * Witness Printer took 93.44ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 918 locations, 203 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.1s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5778 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1900 mSDsluCounter, 990 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 283 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5462 IncrementalHoareTripleChecker+Invalid, 5745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 283 mSolverCounterUnsat, 982 mSDtfsCounter, 5462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1073occurred in iteration=12, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 4063 NumberOfCodeBlocks, 4063 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4024 ConstructedInterpolants, 0 QuantifiedInterpolants, 4102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 107 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:23,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE