./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.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/chl-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:11,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:11,256 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:30:11,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:11,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:11,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:11,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:11,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:11,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:11,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:11,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:11,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:11,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:11,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:11,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:11,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:11,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:11,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:11,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:11,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:11,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:11,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:11,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:11,277 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2025-01-09 21:30:11,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:11,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:11,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:11,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:11,508 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:11,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-01-09 21:30:12,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51a6fce1f/2cc057c8cf18462a94a8502ff8207a2c/FLAGeea565ec9 [2025-01-09 21:30:12,850 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:12,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-01-09 21:30:12,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51a6fce1f/2cc057c8cf18462a94a8502ff8207a2c/FLAGeea565ec9 [2025-01-09 21:30:13,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51a6fce1f/2cc057c8cf18462a94a8502ff8207a2c [2025-01-09 21:30:13,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:13,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:13,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:13,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:13,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:13,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13, skipping insertion in model container [2025-01-09 21:30:13,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:13,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:13,318 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:13,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:13,367 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:13,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13 WrapperNode [2025-01-09 21:30:13,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:13,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:13,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:13,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:13,375 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:30:13" (1/1) ... [2025-01-09 21:30:13,384 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:30:13" (1/1) ... [2025-01-09 21:30:13,422 INFO L138 Inliner]: procedures = 25, calls = 33, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 428 [2025-01-09 21:30:13,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:13,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:13,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:13,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:13,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:13,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:13,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:13,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:13,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:13,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:13,498 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:30:13,503 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:30:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:13,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:13,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:13,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:13,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:13,517 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:30:13,591 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:13,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:14,105 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:14,106 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:14,119 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:14,119 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:14,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:14 BoogieIcfgContainer [2025-01-09 21:30:14,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:14,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:14,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:14,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:14,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:13" (1/3) ... [2025-01-09 21:30:14,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1e9e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:14, skipping insertion in model container [2025-01-09 21:30:14,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13" (2/3) ... [2025-01-09 21:30:14,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1e9e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:14, skipping insertion in model container [2025-01-09 21:30:14,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:14" (3/3) ... [2025-01-09 21:30:14,126 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-01-09 21:30:14,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:14,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 557 locations, 1 initial locations, 6 loop locations, and 47 error locations. [2025-01-09 21:30:14,141 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:14,305 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:14,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 566 places, 583 transitions, 1187 flow [2025-01-09 21:30:14,471 INFO L124 PetriNetUnfolderBase]: 27/580 cut-off events. [2025-01-09 21:30:14,473 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:14,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 580 events. 27/580 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1246 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 431. Up to 2 conditions per place. [2025-01-09 21:30:14,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 566 places, 583 transitions, 1187 flow [2025-01-09 21:30:14,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 545 places, 560 transitions, 1138 flow [2025-01-09 21:30:14,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:14,515 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;@65d3455a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:14,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-01-09 21:30:14,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:14,549 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2025-01-09 21:30:14,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:14,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:14,550 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:30:14,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:14,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:14,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1757369802, now seen corresponding path program 1 times [2025-01-09 21:30:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:14,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423764901] [2025-01-09 21:30:14,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:14,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:30:14,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:30:14,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:14,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:14,704 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,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423764901] [2025-01-09 21:30:14,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423764901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:14,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:14,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:14,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298775123] [2025-01-09 21:30:14,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:14,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:14,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:14,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:14,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:14,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-01-09 21:30:14,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 560 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:14,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-01-09 21:30:14,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:15,076 INFO L124 PetriNetUnfolderBase]: 24/966 cut-off events. [2025-01-09 21:30:15,077 INFO L125 PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES. [2025-01-09 21:30:15,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 966 events. 24/966 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3999 event pairs, 7 based on Foata normal form. 42/870 useless extension candidates. Maximal degree in co-relation 762. Up to 25 conditions per place. [2025-01-09 21:30:15,094 INFO L140 encePairwiseOnDemand]: 564/583 looper letters, 11 selfloop transitions, 2 changer transitions 7/543 dead transitions. [2025-01-09 21:30:15,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 543 transitions, 1130 flow [2025-01-09 21:30:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1680 transitions. [2025-01-09 21:30:15,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9605488850771869 [2025-01-09 21:30:15,119 INFO L175 Difference]: Start difference. First operand has 545 places, 560 transitions, 1138 flow. Second operand 3 states and 1680 transitions. [2025-01-09 21:30:15,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 543 transitions, 1130 flow [2025-01-09 21:30:15,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 543 transitions, 1118 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:15,135 INFO L231 Difference]: Finished difference. Result has 540 places, 536 transitions, 1082 flow [2025-01-09 21:30:15,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=540, PETRI_TRANSITIONS=536} [2025-01-09 21:30:15,139 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -5 predicate places. [2025-01-09 21:30:15,140 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 536 transitions, 1082 flow [2025-01-09 21:30:15,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:15,141 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:30:15,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:15,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:15,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1067641087, now seen corresponding path program 1 times [2025-01-09 21:30:15,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:15,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672009144] [2025-01-09 21:30:15,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:15,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:15,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:30:15,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:30:15,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:15,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:15,637 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,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:15,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672009144] [2025-01-09 21:30:15,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672009144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:15,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:15,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:15,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036076669] [2025-01-09 21:30:15,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:15,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:15,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:15,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:15,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 493 out of 583 [2025-01-09 21:30:15,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 536 transitions, 1082 flow. Second operand has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 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,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:15,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 493 of 583 [2025-01-09 21:30:15,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:17,870 INFO L124 PetriNetUnfolderBase]: 2074/15183 cut-off events. [2025-01-09 21:30:17,870 INFO L125 PetriNetUnfolderBase]: For 179/181 co-relation queries the response was YES. [2025-01-09 21:30:17,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18113 conditions, 15183 events. 2074/15183 cut-off events. For 179/181 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 184132 event pairs, 1520 based on Foata normal form. 0/12818 useless extension candidates. Maximal degree in co-relation 18028. Up to 2820 conditions per place. [2025-01-09 21:30:17,973 INFO L140 encePairwiseOnDemand]: 565/583 looper letters, 54 selfloop transitions, 15 changer transitions 0/533 dead transitions. [2025-01-09 21:30:17,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 533 transitions, 1214 flow [2025-01-09 21:30:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3030 transitions. [2025-01-09 21:30:17,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8662092624356775 [2025-01-09 21:30:17,981 INFO L175 Difference]: Start difference. First operand has 540 places, 536 transitions, 1082 flow. Second operand 6 states and 3030 transitions. [2025-01-09 21:30:17,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 533 transitions, 1214 flow [2025-01-09 21:30:17,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 533 transitions, 1210 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:17,989 INFO L231 Difference]: Finished difference. Result has 533 places, 533 transitions, 1102 flow [2025-01-09 21:30:17,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1102, PETRI_PLACES=533, PETRI_TRANSITIONS=533} [2025-01-09 21:30:17,991 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -12 predicate places. [2025-01-09 21:30:17,991 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 533 transitions, 1102 flow [2025-01-09 21:30:17,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 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,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:17,992 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] [2025-01-09 21:30:17,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:17,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:17,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1593886241, now seen corresponding path program 1 times [2025-01-09 21:30:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:17,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237158009] [2025-01-09 21:30:17,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 21:30:18,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 21:30:18,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,044 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,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237158009] [2025-01-09 21:30:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237158009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994644988] [2025-01-09 21:30:18,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:18,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:18,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:18,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-01-09 21:30:18,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 533 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-01-09 21:30:18,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,137 INFO L124 PetriNetUnfolderBase]: 18/748 cut-off events. [2025-01-09 21:30:18,137 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:18,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 748 events. 18/748 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2609 event pairs, 5 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 746. Up to 22 conditions per place. [2025-01-09 21:30:18,144 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-01-09 21:30:18,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 532 transitions, 1126 flow [2025-01-09 21:30:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-01-09 21:30:18,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-01-09 21:30:18,147 INFO L175 Difference]: Start difference. First operand has 533 places, 533 transitions, 1102 flow. Second operand 3 states and 1664 transitions. [2025-01-09 21:30:18,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 532 transitions, 1126 flow [2025-01-09 21:30:18,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 532 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:18,153 INFO L231 Difference]: Finished difference. Result has 529 places, 532 transitions, 1074 flow [2025-01-09 21:30:18,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=529, PETRI_TRANSITIONS=532} [2025-01-09 21:30:18,154 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -16 predicate places. [2025-01-09 21:30:18,154 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 532 transitions, 1074 flow [2025-01-09 21:30:18,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,156 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] [2025-01-09 21:30:18,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:18,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2118230293, now seen corresponding path program 1 times [2025-01-09 21:30:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-01-09 21:30:18,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:30:18,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:30:18,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,237 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,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-01-09 21:30:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863702791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:18,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636422369] [2025-01-09 21:30:18,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:18,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:18,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:18,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-01-09 21:30:18,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 532 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-01-09 21:30:18,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,321 INFO L124 PetriNetUnfolderBase]: 18/645 cut-off events. [2025-01-09 21:30:18,321 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:30:18,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 645 events. 18/645 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2012 event pairs, 7 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 560. Up to 25 conditions per place. [2025-01-09 21:30:18,327 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2025-01-09 21:30:18,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 531 transitions, 1098 flow [2025-01-09 21:30:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-01-09 21:30:18,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-01-09 21:30:18,330 INFO L175 Difference]: Start difference. First operand has 529 places, 532 transitions, 1074 flow. Second operand 3 states and 1664 transitions. [2025-01-09 21:30:18,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 531 transitions, 1098 flow [2025-01-09 21:30:18,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 531 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:18,336 INFO L231 Difference]: Finished difference. Result has 528 places, 531 transitions, 1072 flow [2025-01-09 21:30:18,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=528, PETRI_TRANSITIONS=531} [2025-01-09 21:30:18,337 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -17 predicate places. [2025-01-09 21:30:18,337 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 531 transitions, 1072 flow [2025-01-09 21:30:18,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:18,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:18,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:18,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1022604339, now seen corresponding path program 1 times [2025-01-09 21:30:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441890286] [2025-01-09 21:30:18,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:18,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:18,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,395 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,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441890286] [2025-01-09 21:30:18,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441890286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080552986] [2025-01-09 21:30:18,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:18,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:18,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:18,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-01-09 21:30:18,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 531 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-01-09 21:30:18,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,571 INFO L124 PetriNetUnfolderBase]: 28/1131 cut-off events. [2025-01-09 21:30:18,571 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:18,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 1131 events. 28/1131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5490 event pairs, 7 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1002. Up to 25 conditions per place. [2025-01-09 21:30:18,581 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-01-09 21:30:18,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 530 transitions, 1096 flow [2025-01-09 21:30:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-01-09 21:30:18,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-01-09 21:30:18,587 INFO L175 Difference]: Start difference. First operand has 528 places, 531 transitions, 1072 flow. Second operand 3 states and 1664 transitions. [2025-01-09 21:30:18,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 530 transitions, 1096 flow [2025-01-09 21:30:18,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 530 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:18,601 INFO L231 Difference]: Finished difference. Result has 527 places, 530 transitions, 1070 flow [2025-01-09 21:30:18,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=527, PETRI_TRANSITIONS=530} [2025-01-09 21:30:18,602 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2025-01-09 21:30:18,602 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 530 transitions, 1070 flow [2025-01-09 21:30:18,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,603 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] [2025-01-09 21:30:18,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:18,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:18,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1073809461, now seen corresponding path program 1 times [2025-01-09 21:30:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001183320] [2025-01-09 21:30:18,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:30:18,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:30:18,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,679 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,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001183320] [2025-01-09 21:30:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001183320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:18,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115130839] [2025-01-09 21:30:18,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:18,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:18,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:18,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-01-09 21:30:18,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 530 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-01-09 21:30:18,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,862 INFO L124 PetriNetUnfolderBase]: 22/941 cut-off events. [2025-01-09 21:30:18,863 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-01-09 21:30:18,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 941 events. 22/941 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3537 event pairs, 5 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 799. Up to 22 conditions per place. [2025-01-09 21:30:18,871 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-01-09 21:30:18,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 529 transitions, 1094 flow [2025-01-09 21:30:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-01-09 21:30:18,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-01-09 21:30:18,874 INFO L175 Difference]: Start difference. First operand has 527 places, 530 transitions, 1070 flow. Second operand 3 states and 1664 transitions. [2025-01-09 21:30:18,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 529 transitions, 1094 flow [2025-01-09 21:30:18,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1090 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:18,880 INFO L231 Difference]: Finished difference. Result has 526 places, 529 transitions, 1068 flow [2025-01-09 21:30:18,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=526, PETRI_TRANSITIONS=529} [2025-01-09 21:30:18,883 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-01-09 21:30:18,883 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 529 transitions, 1068 flow [2025-01-09 21:30:18,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,884 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] [2025-01-09 21:30:18,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:18,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:18,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash 493637186, now seen corresponding path program 1 times [2025-01-09 21:30:18,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615177552] [2025-01-09 21:30:18,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:30:18,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:30:18,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,934 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,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615177552] [2025-01-09 21:30:18,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615177552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:18,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866004811] [2025-01-09 21:30:18,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:18,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:18,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:18,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-01-09 21:30:18,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 529 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-01-09 21:30:18,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,039 INFO L124 PetriNetUnfolderBase]: 24/906 cut-off events. [2025-01-09 21:30:19,040 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-01-09 21:30:19,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 906 events. 24/906 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3280 event pairs, 7 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 758. Up to 25 conditions per place. [2025-01-09 21:30:19,048 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-01-09 21:30:19,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 528 transitions, 1092 flow [2025-01-09 21:30:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-01-09 21:30:19,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-01-09 21:30:19,052 INFO L175 Difference]: Start difference. First operand has 526 places, 529 transitions, 1068 flow. Second operand 3 states and 1664 transitions. [2025-01-09 21:30:19,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 528 transitions, 1092 flow [2025-01-09 21:30:19,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 528 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:19,057 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1066 flow [2025-01-09 21:30:19,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2025-01-09 21:30:19,059 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2025-01-09 21:30:19,059 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1066 flow [2025-01-09 21:30:19,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,061 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] [2025-01-09 21:30:19,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:19,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:19,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2054288223, now seen corresponding path program 1 times [2025-01-09 21:30:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64856290] [2025-01-09 21:30:19,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:19,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:19,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:30:19,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:30:19,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:19,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:19,115 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,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:19,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64856290] [2025-01-09 21:30:19,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64856290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:19,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:19,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:19,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034247725] [2025-01-09 21:30:19,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:19,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:19,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:19,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:19,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:19,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-01-09 21:30:19,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:19,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-01-09 21:30:19,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,262 INFO L124 PetriNetUnfolderBase]: 45/1330 cut-off events. [2025-01-09 21:30:19,262 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:30:19,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1330 events. 45/1330 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7325 event pairs, 6 based on Foata normal form. 0/1148 useless extension candidates. Maximal degree in co-relation 1204. Up to 43 conditions per place. [2025-01-09 21:30:19,275 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-01-09 21:30:19,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 530 transitions, 1102 flow [2025-01-09 21:30:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-01-09 21:30:19,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-01-09 21:30:19,278 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1066 flow. Second operand 3 states and 1673 transitions. [2025-01-09 21:30:19,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 530 transitions, 1102 flow [2025-01-09 21:30:19,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 530 transitions, 1098 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:19,287 INFO L231 Difference]: Finished difference. Result has 524 places, 528 transitions, 1072 flow [2025-01-09 21:30:19,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=524, PETRI_TRANSITIONS=528} [2025-01-09 21:30:19,288 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -21 predicate places. [2025-01-09 21:30:19,288 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 528 transitions, 1072 flow [2025-01-09 21:30:19,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,289 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:19,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:19,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:19,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1388791001, now seen corresponding path program 1 times [2025-01-09 21:30:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045011522] [2025-01-09 21:30:19,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:19,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 21:30:19,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 21:30:19,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:19,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:19,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:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045011522] [2025-01-09 21:30:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045011522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402337482] [2025-01-09 21:30:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:19,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:19,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:19,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:19,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-01-09 21:30:19,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 528 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:19,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-01-09 21:30:19,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,453 INFO L124 PetriNetUnfolderBase]: 36/1203 cut-off events. [2025-01-09 21:30:19,453 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:19,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 1203 events. 36/1203 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5733 event pairs, 6 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 953. Up to 31 conditions per place. [2025-01-09 21:30:19,466 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-01-09 21:30:19,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 530 transitions, 1108 flow [2025-01-09 21:30:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-01-09 21:30:19,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-01-09 21:30:19,469 INFO L175 Difference]: Start difference. First operand has 524 places, 528 transitions, 1072 flow. Second operand 3 states and 1673 transitions. [2025-01-09 21:30:19,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 530 transitions, 1108 flow [2025-01-09 21:30:19,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 530 transitions, 1108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:19,474 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1082 flow [2025-01-09 21:30:19,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2025-01-09 21:30:19,476 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2025-01-09 21:30:19,476 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1082 flow [2025-01-09 21:30:19,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,477 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] [2025-01-09 21:30:19,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:19,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:19,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2109996070, now seen corresponding path program 1 times [2025-01-09 21:30:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036386674] [2025-01-09 21:30:19,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:19,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:30:19,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:30:19,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:19,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:19,516 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,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:19,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036386674] [2025-01-09 21:30:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036386674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:19,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087331099] [2025-01-09 21:30:19,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:19,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:19,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:19,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:19,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 583 [2025-01-09 21:30:19,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1082 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:19,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 583 [2025-01-09 21:30:19,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,682 INFO L124 PetriNetUnfolderBase]: 39/1108 cut-off events. [2025-01-09 21:30:19,682 INFO L125 PetriNetUnfolderBase]: For 2/14 co-relation queries the response was YES. [2025-01-09 21:30:19,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1108 events. 39/1108 cut-off events. For 2/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5614 event pairs, 12 based on Foata normal form. 1/971 useless extension candidates. Maximal degree in co-relation 891. Up to 38 conditions per place. [2025-01-09 21:30:19,692 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 15 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-01-09 21:30:19,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2025-01-09 21:30:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2025-01-09 21:30:19,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9519725557461407 [2025-01-09 21:30:19,698 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1082 flow. Second operand 3 states and 1665 transitions. [2025-01-09 21:30:19,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2025-01-09 21:30:19,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:19,712 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1084 flow [2025-01-09 21:30:19,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2025-01-09 21:30:19,714 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-01-09 21:30:19,714 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1084 flow [2025-01-09 21:30:19,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,717 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:19,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:19,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:19,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1435686378, now seen corresponding path program 1 times [2025-01-09 21:30:19,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877055067] [2025-01-09 21:30:19,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:19,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 21:30:19,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 21:30:19,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:19,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:19,817 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,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:19,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877055067] [2025-01-09 21:30:19,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877055067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:19,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:19,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:19,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253246368] [2025-01-09 21:30:19,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:19,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:19,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:19,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:19,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-01-09 21:30:19,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:19,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-01-09 21:30:19,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:20,308 INFO L124 PetriNetUnfolderBase]: 77/2149 cut-off events. [2025-01-09 21:30:20,309 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-01-09 21:30:20,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 2149 events. 77/2149 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 15031 event pairs, 16 based on Foata normal form. 0/1857 useless extension candidates. Maximal degree in co-relation 1651. Up to 66 conditions per place. [2025-01-09 21:30:20,328 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-01-09 21:30:20,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2025-01-09 21:30:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-01-09 21:30:20,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-01-09 21:30:20,332 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1084 flow. Second operand 3 states and 1673 transitions. [2025-01-09 21:30:20,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2025-01-09 21:30:20,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 529 transitions, 1116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:20,339 INFO L231 Difference]: Finished difference. Result has 525 places, 527 transitions, 1090 flow [2025-01-09 21:30:20,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=525, PETRI_TRANSITIONS=527} [2025-01-09 21:30:20,340 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2025-01-09 21:30:20,340 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 527 transitions, 1090 flow [2025-01-09 21:30:20,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:20,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:20,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:20,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:20,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 901506352, now seen corresponding path program 1 times [2025-01-09 21:30:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908073263] [2025-01-09 21:30:20,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:20,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:30:20,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:30:20,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:20,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:20,389 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:20,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908073263] [2025-01-09 21:30:20,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908073263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:20,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:20,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:20,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515517519] [2025-01-09 21:30:20,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:20,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:20,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:20,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:20,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:20,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-01-09 21:30:20,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 527 transitions, 1090 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:20,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-01-09 21:30:20,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:20,694 INFO L124 PetriNetUnfolderBase]: 77/1945 cut-off events. [2025-01-09 21:30:20,695 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2025-01-09 21:30:20,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 1945 events. 77/1945 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 12830 event pairs, 4 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 1564. Up to 69 conditions per place. [2025-01-09 21:30:20,722 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-01-09 21:30:20,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 532 transitions, 1141 flow [2025-01-09 21:30:20,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2025-01-09 21:30:20,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9582618639222413 [2025-01-09 21:30:20,727 INFO L175 Difference]: Start difference. First operand has 525 places, 527 transitions, 1090 flow. Second operand 3 states and 1676 transitions. [2025-01-09 21:30:20,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 532 transitions, 1141 flow [2025-01-09 21:30:20,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 532 transitions, 1141 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:20,734 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1100 flow [2025-01-09 21:30:20,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2025-01-09 21:30:20,736 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-01-09 21:30:20,736 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1100 flow [2025-01-09 21:30:20,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:20,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:20,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:20,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:20,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash -204054210, now seen corresponding path program 1 times [2025-01-09 21:30:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:20,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379614838] [2025-01-09 21:30:20,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:20,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:30:20,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:30:20,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:20,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:20,787 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:20,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:20,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379614838] [2025-01-09 21:30:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379614838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609224533] [2025-01-09 21:30:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:20,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:20,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:20,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-01-09 21:30:20,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 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,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:20,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-01-09 21:30:20,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:21,107 INFO L124 PetriNetUnfolderBase]: 96/1871 cut-off events. [2025-01-09 21:30:21,108 INFO L125 PetriNetUnfolderBase]: For 24/56 co-relation queries the response was YES. [2025-01-09 21:30:21,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 1871 events. 96/1871 cut-off events. For 24/56 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12701 event pairs, 30 based on Foata normal form. 1/1626 useless extension candidates. Maximal degree in co-relation 1412. Up to 100 conditions per place. [2025-01-09 21:30:21,131 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-01-09 21:30:21,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 528 transitions, 1140 flow [2025-01-09 21:30:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-01-09 21:30:21,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-01-09 21:30:21,135 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1100 flow. Second operand 3 states and 1663 transitions. [2025-01-09 21:30:21,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 528 transitions, 1140 flow [2025-01-09 21:30:21,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 528 transitions, 1140 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:21,142 INFO L231 Difference]: Finished difference. Result has 527 places, 526 transitions, 1102 flow [2025-01-09 21:30:21,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=527, PETRI_TRANSITIONS=526} [2025-01-09 21:30:21,143 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2025-01-09 21:30:21,143 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 526 transitions, 1102 flow [2025-01-09 21:30:21,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 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,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:21,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:21,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:21,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:21,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:21,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2118104626, now seen corresponding path program 1 times [2025-01-09 21:30:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036302927] [2025-01-09 21:30:21,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:21,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:30:21,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:30:21,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:21,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,191 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,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036302927] [2025-01-09 21:30:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036302927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:21,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305266305] [2025-01-09 21:30:21,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:21,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:21,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:21,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 547 out of 583 [2025-01-09 21:30:21,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 526 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 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,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:21,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 547 of 583 [2025-01-09 21:30:21,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:21,511 INFO L124 PetriNetUnfolderBase]: 90/2593 cut-off events. [2025-01-09 21:30:21,511 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-01-09 21:30:21,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 2593 events. 90/2593 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 17693 event pairs, 10 based on Foata normal form. 0/2265 useless extension candidates. Maximal degree in co-relation 2378. Up to 40 conditions per place. [2025-01-09 21:30:21,534 INFO L140 encePairwiseOnDemand]: 575/583 looper letters, 15 selfloop transitions, 5 changer transitions 0/528 dead transitions. [2025-01-09 21:30:21,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 528 transitions, 1148 flow [2025-01-09 21:30:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-01-09 21:30:21,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-01-09 21:30:21,537 INFO L175 Difference]: Start difference. First operand has 527 places, 526 transitions, 1102 flow. Second operand 3 states and 1664 transitions. [2025-01-09 21:30:21,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 528 transitions, 1148 flow [2025-01-09 21:30:21,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 528 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:21,542 INFO L231 Difference]: Finished difference. Result has 526 places, 526 transitions, 1124 flow [2025-01-09 21:30:21,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=526, PETRI_TRANSITIONS=526} [2025-01-09 21:30:21,543 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-01-09 21:30:21,543 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 526 transitions, 1124 flow [2025-01-09 21:30:21,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 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,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:21,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:21,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:21,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:21,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:21,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1235516788, now seen corresponding path program 1 times [2025-01-09 21:30:21,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:21,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171448825] [2025-01-09 21:30:21,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:21,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:21,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:30:21,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:30:21,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:21,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,614 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,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171448825] [2025-01-09 21:30:21,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171448825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:30:21,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468551683] [2025-01-09 21:30:21,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:30:21,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:30:21,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:30:21,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 583 [2025-01-09 21:30:21,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 526 transitions, 1124 flow. Second operand has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 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,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:21,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 583 [2025-01-09 21:30:21,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,022 INFO L124 PetriNetUnfolderBase]: 99/3208 cut-off events. [2025-01-09 21:30:22,022 INFO L125 PetriNetUnfolderBase]: For 36/70 co-relation queries the response was YES. [2025-01-09 21:30:22,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3491 conditions, 3208 events. 99/3208 cut-off events. For 36/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 22102 event pairs, 15 based on Foata normal form. 4/2801 useless extension candidates. Maximal degree in co-relation 3074. Up to 50 conditions per place. [2025-01-09 21:30:22,058 INFO L140 encePairwiseOnDemand]: 578/583 looper letters, 27 selfloop transitions, 4 changer transitions 0/542 dead transitions. [2025-01-09 21:30:22,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 542 transitions, 1228 flow [2025-01-09 21:30:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2787 transitions. [2025-01-09 21:30:22,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560891938250429 [2025-01-09 21:30:22,062 INFO L175 Difference]: Start difference. First operand has 526 places, 526 transitions, 1124 flow. Second operand 5 states and 2787 transitions. [2025-01-09 21:30:22,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 542 transitions, 1228 flow [2025-01-09 21:30:22,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 542 transitions, 1218 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:22,068 INFO L231 Difference]: Finished difference. Result has 531 places, 528 transitions, 1139 flow [2025-01-09 21:30:22,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1139, PETRI_PLACES=531, PETRI_TRANSITIONS=528} [2025-01-09 21:30:22,069 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -14 predicate places. [2025-01-09 21:30:22,069 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 528 transitions, 1139 flow [2025-01-09 21:30:22,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 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,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:22,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:22,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:22,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash -634317799, now seen corresponding path program 1 times [2025-01-09 21:30:22,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438692480] [2025-01-09 21:30:22,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:30:22,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:30:22,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,148 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,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438692480] [2025-01-09 21:30:22,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438692480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:22,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:22,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163122351] [2025-01-09 21:30:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:22,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:30:22,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:22,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:30:22,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:30:22,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 583 [2025-01-09 21:30:22,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 528 transitions, 1139 flow. Second operand has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 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,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 583 [2025-01-09 21:30:22,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,453 INFO L124 PetriNetUnfolderBase]: 33/1368 cut-off events. [2025-01-09 21:30:22,454 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2025-01-09 21:30:22,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 1368 events. 33/1368 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6529 event pairs, 1 based on Foata normal form. 3/1218 useless extension candidates. Maximal degree in co-relation 1367. Up to 20 conditions per place. [2025-01-09 21:30:22,471 INFO L140 encePairwiseOnDemand]: 562/583 looper letters, 18 selfloop transitions, 18 changer transitions 0/531 dead transitions. [2025-01-09 21:30:22,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 531 transitions, 1217 flow [2025-01-09 21:30:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2699 transitions. [2025-01-09 21:30:22,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259005145797599 [2025-01-09 21:30:22,475 INFO L175 Difference]: Start difference. First operand has 531 places, 528 transitions, 1139 flow. Second operand 5 states and 2699 transitions. [2025-01-09 21:30:22,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 531 transitions, 1217 flow [2025-01-09 21:30:22,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 531 transitions, 1217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:22,481 INFO L231 Difference]: Finished difference. Result has 536 places, 531 transitions, 1199 flow [2025-01-09 21:30:22,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1199, PETRI_PLACES=536, PETRI_TRANSITIONS=531} [2025-01-09 21:30:22,482 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -9 predicate places. [2025-01-09 21:30:22,482 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 531 transitions, 1199 flow [2025-01-09 21:30:22,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 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,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:22,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:22,484 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:22,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 771082, now seen corresponding path program 1 times [2025-01-09 21:30:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839855265] [2025-01-09 21:30:22,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:30:22,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:30:22,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839855265] [2025-01-09 21:30:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839855265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:30:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427324432] [2025-01-09 21:30:22,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:22,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:22,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:30:22,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:30:22,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:30:22,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:30:22,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:30:22,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:30:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:22,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:30:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427324432] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:30:23,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:30:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 21:30:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514145597] [2025-01-09 21:30:23,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:30:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:30:23,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:30:23,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 583 [2025-01-09 21:30:23,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 531 transitions, 1199 flow. Second operand has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 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,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 583 [2025-01-09 21:30:23,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,791 INFO L124 PetriNetUnfolderBase]: 33/1419 cut-off events. [2025-01-09 21:30:23,791 INFO L125 PetriNetUnfolderBase]: For 23/37 co-relation queries the response was YES. [2025-01-09 21:30:23,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 1419 events. 33/1419 cut-off events. For 23/37 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6440 event pairs, 1 based on Foata normal form. 6/1272 useless extension candidates. Maximal degree in co-relation 1481. Up to 20 conditions per place. [2025-01-09 21:30:23,807 INFO L140 encePairwiseOnDemand]: 553/583 looper letters, 30 selfloop transitions, 39 changer transitions 0/555 dead transitions. [2025-01-09 21:30:23,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 555 transitions, 1391 flow [2025-01-09 21:30:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5828 transitions. [2025-01-09 21:30:23,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087790425697801 [2025-01-09 21:30:23,814 INFO L175 Difference]: Start difference. First operand has 536 places, 531 transitions, 1199 flow. Second operand 11 states and 5828 transitions. [2025-01-09 21:30:23,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 555 transitions, 1391 flow [2025-01-09 21:30:23,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 555 transitions, 1361 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:30:23,820 INFO L231 Difference]: Finished difference. Result has 546 places, 549 transitions, 1349 flow [2025-01-09 21:30:23,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1349, PETRI_PLACES=546, PETRI_TRANSITIONS=549} [2025-01-09 21:30:23,821 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2025-01-09 21:30:23,821 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 549 transitions, 1349 flow [2025-01-09 21:30:23,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 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,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,827 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 21:30:24,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 21:30:24,028 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:24,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash -270392662, now seen corresponding path program 2 times [2025-01-09 21:30:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508283789] [2025-01-09 21:30:24,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:30:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-01-09 21:30:24,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 171 of 306 statements. [2025-01-09 21:30:24,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:30:24,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:24,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508283789] [2025-01-09 21:30:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508283789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66706785] [2025-01-09 21:30:24,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:24,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:24,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-01-09 21:30:24,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 549 transitions, 1349 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:24,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-01-09 21:30:24,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,045 INFO L124 PetriNetUnfolderBase]: 77/2321 cut-off events. [2025-01-09 21:30:25,045 INFO L125 PetriNetUnfolderBase]: For 50/92 co-relation queries the response was YES. [2025-01-09 21:30:25,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 2321 events. 77/2321 cut-off events. For 50/92 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 14113 event pairs, 5 based on Foata normal form. 8/2072 useless extension candidates. Maximal degree in co-relation 2566. Up to 70 conditions per place. [2025-01-09 21:30:25,062 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 30 selfloop transitions, 6 changer transitions 0/556 dead transitions. [2025-01-09 21:30:25,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 556 transitions, 1443 flow [2025-01-09 21:30:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2025-01-09 21:30:25,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313893653516295 [2025-01-09 21:30:25,065 INFO L175 Difference]: Start difference. First operand has 546 places, 549 transitions, 1349 flow. Second operand 6 states and 3258 transitions. [2025-01-09 21:30:25,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 556 transitions, 1443 flow [2025-01-09 21:30:25,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 556 transitions, 1407 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-09 21:30:25,076 INFO L231 Difference]: Finished difference. Result has 547 places, 548 transitions, 1323 flow [2025-01-09 21:30:25,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1323, PETRI_PLACES=547, PETRI_TRANSITIONS=548} [2025-01-09 21:30:25,076 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 2 predicate places. [2025-01-09 21:30:25,076 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 548 transitions, 1323 flow [2025-01-09 21:30:25,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:25,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,078 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:25,078 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:25,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash -375392664, now seen corresponding path program 1 times [2025-01-09 21:30:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489282644] [2025-01-09 21:30:25,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 21:30:25,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 21:30:25,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:25,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489282644] [2025-01-09 21:30:25,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489282644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237991203] [2025-01-09 21:30:25,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 583 [2025-01-09 21:30:25,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 548 transitions, 1323 flow. Second operand has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 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:25,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 583 [2025-01-09 21:30:25,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,767 INFO L124 PetriNetUnfolderBase]: 142/4514 cut-off events. [2025-01-09 21:30:25,767 INFO L125 PetriNetUnfolderBase]: For 59/106 co-relation queries the response was YES. [2025-01-09 21:30:25,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4981 conditions, 4514 events. 142/4514 cut-off events. For 59/106 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 35062 event pairs, 28 based on Foata normal form. 7/3959 useless extension candidates. Maximal degree in co-relation 4652. Up to 95 conditions per place. [2025-01-09 21:30:25,814 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 17 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2025-01-09 21:30:25,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 549 transitions, 1365 flow [2025-01-09 21:30:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2025-01-09 21:30:25,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9519725557461407 [2025-01-09 21:30:25,817 INFO L175 Difference]: Start difference. First operand has 547 places, 548 transitions, 1323 flow. Second operand 3 states and 1665 transitions. [2025-01-09 21:30:25,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 549 transitions, 1365 flow [2025-01-09 21:30:25,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 549 transitions, 1353 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:25,823 INFO L231 Difference]: Finished difference. Result has 543 places, 547 transitions, 1313 flow [2025-01-09 21:30:25,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=543, PETRI_TRANSITIONS=547} [2025-01-09 21:30:25,823 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2025-01-09 21:30:25,823 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 547 transitions, 1313 flow [2025-01-09 21:30:25,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 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:25,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,824 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:25,825 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:25,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash 184775420, now seen corresponding path program 1 times [2025-01-09 21:30:25,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462832735] [2025-01-09 21:30:25,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 21:30:25,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 21:30:25,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462832735] [2025-01-09 21:30:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462832735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639635936] [2025-01-09 21:30:25,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-01-09 21:30:25,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 547 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:25,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-01-09 21:30:25,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:26,284 INFO L124 PetriNetUnfolderBase]: 145/2185 cut-off events. [2025-01-09 21:30:26,285 INFO L125 PetriNetUnfolderBase]: For 121/165 co-relation queries the response was YES. [2025-01-09 21:30:26,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2587 conditions, 2185 events. 145/2185 cut-off events. For 121/165 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 14552 event pairs, 61 based on Foata normal form. 1/1889 useless extension candidates. Maximal degree in co-relation 2258. Up to 187 conditions per place. [2025-01-09 21:30:26,308 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2025-01-09 21:30:26,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 548 transitions, 1353 flow [2025-01-09 21:30:26,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-01-09 21:30:26,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-01-09 21:30:26,311 INFO L175 Difference]: Start difference. First operand has 543 places, 547 transitions, 1313 flow. Second operand 3 states and 1663 transitions. [2025-01-09 21:30:26,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 548 transitions, 1353 flow [2025-01-09 21:30:26,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 548 transitions, 1349 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:26,318 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1311 flow [2025-01-09 21:30:26,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2025-01-09 21:30:26,319 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2025-01-09 21:30:26,319 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1311 flow [2025-01-09 21:30:26,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:26,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:26,320 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:26,320 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:26,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:26,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1017626859, now seen corresponding path program 1 times [2025-01-09 21:30:26,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:26,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535874329] [2025-01-09 21:30:26,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:26,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:26,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 21:30:26,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 21:30:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:26,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:26,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535874329] [2025-01-09 21:30:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535874329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:26,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:26,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436038490] [2025-01-09 21:30:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:26,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:26,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:26,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:26,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:26,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 583 [2025-01-09 21:30:26,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:26,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:26,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 583 [2025-01-09 21:30:26,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:26,975 INFO L124 PetriNetUnfolderBase]: 154/3695 cut-off events. [2025-01-09 21:30:26,975 INFO L125 PetriNetUnfolderBase]: For 47/115 co-relation queries the response was YES. [2025-01-09 21:30:27,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4180 conditions, 3695 events. 154/3695 cut-off events. For 47/115 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 27457 event pairs, 25 based on Foata normal form. 1/3273 useless extension candidates. Maximal degree in co-relation 3851. Up to 110 conditions per place. [2025-01-09 21:30:27,024 INFO L140 encePairwiseOnDemand]: 574/583 looper letters, 17 selfloop transitions, 5 changer transitions 0/547 dead transitions. [2025-01-09 21:30:27,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 547 transitions, 1359 flow [2025-01-09 21:30:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1658 transitions. [2025-01-09 21:30:27,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479702687249857 [2025-01-09 21:30:27,026 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1311 flow. Second operand 3 states and 1658 transitions. [2025-01-09 21:30:27,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 547 transitions, 1359 flow [2025-01-09 21:30:27,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 547 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:27,034 INFO L231 Difference]: Finished difference. Result has 540 places, 545 transitions, 1331 flow [2025-01-09 21:30:27,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=540, PETRI_TRANSITIONS=545} [2025-01-09 21:30:27,035 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -5 predicate places. [2025-01-09 21:30:27,035 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 545 transitions, 1331 flow [2025-01-09 21:30:27,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:27,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:27,036 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:27,036 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:27,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2145700301, now seen corresponding path program 1 times [2025-01-09 21:30:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:27,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573883484] [2025-01-09 21:30:27,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:27,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 21:30:27,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 21:30:27,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:27,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573883484] [2025-01-09 21:30:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573883484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289080800] [2025-01-09 21:30:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:27,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:27,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-01-09 21:30:27,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 545 transitions, 1331 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:27,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:27,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-01-09 21:30:27,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:27,664 INFO L124 PetriNetUnfolderBase]: 136/3757 cut-off events. [2025-01-09 21:30:27,664 INFO L125 PetriNetUnfolderBase]: For 76/112 co-relation queries the response was YES. [2025-01-09 21:30:27,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 3757 events. 136/3757 cut-off events. For 76/112 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 28040 event pairs, 30 based on Foata normal form. 1/3336 useless extension candidates. Maximal degree in co-relation 3883. Up to 141 conditions per place. [2025-01-09 21:30:27,709 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-01-09 21:30:27,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 550 transitions, 1382 flow [2025-01-09 21:30:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2025-01-09 21:30:27,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9582618639222413 [2025-01-09 21:30:27,712 INFO L175 Difference]: Start difference. First operand has 540 places, 545 transitions, 1331 flow. Second operand 3 states and 1676 transitions. [2025-01-09 21:30:27,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 550 transitions, 1382 flow [2025-01-09 21:30:27,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 550 transitions, 1372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:27,717 INFO L231 Difference]: Finished difference. Result has 539 places, 545 transitions, 1331 flow [2025-01-09 21:30:27,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=539, PETRI_TRANSITIONS=545} [2025-01-09 21:30:27,718 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2025-01-09 21:30:27,718 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 545 transitions, 1331 flow [2025-01-09 21:30:27,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:27,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:27,719 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:27,719 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:27,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2083405396, now seen corresponding path program 1 times [2025-01-09 21:30:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:27,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960545268] [2025-01-09 21:30:27,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:27,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 21:30:27,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 21:30:27,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:27,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:27,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960545268] [2025-01-09 21:30:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960545268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:30:27,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791370968] [2025-01-09 21:30:27,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:30:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:30:27,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:30:27,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 583 [2025-01-09 21:30:27,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 545 transitions, 1331 flow. Second operand has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 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:27,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:27,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 583 [2025-01-09 21:30:27,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:28,847 INFO L124 PetriNetUnfolderBase]: 244/6510 cut-off events. [2025-01-09 21:30:28,847 INFO L125 PetriNetUnfolderBase]: For 89/254 co-relation queries the response was YES. [2025-01-09 21:30:28,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 6510 events. 244/6510 cut-off events. For 89/254 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56825 event pairs, 58 based on Foata normal form. 6/5735 useless extension candidates. Maximal degree in co-relation 6989. Up to 155 conditions per place. [2025-01-09 21:30:28,895 INFO L140 encePairwiseOnDemand]: 578/583 looper letters, 25 selfloop transitions, 4 changer transitions 0/559 dead transitions. [2025-01-09 21:30:28,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 559 transitions, 1425 flow [2025-01-09 21:30:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2785 transitions. [2025-01-09 21:30:28,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9554030874785592 [2025-01-09 21:30:28,898 INFO L175 Difference]: Start difference. First operand has 539 places, 545 transitions, 1331 flow. Second operand 5 states and 2785 transitions. [2025-01-09 21:30:28,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 559 transitions, 1425 flow [2025-01-09 21:30:28,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 559 transitions, 1425 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:28,904 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1356 flow [2025-01-09 21:30:28,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1356, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-01-09 21:30:28,905 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2025-01-09 21:30:28,905 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1356 flow [2025-01-09 21:30:28,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 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:28,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:28,906 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:28,906 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:28,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:28,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1857148455, now seen corresponding path program 1 times [2025-01-09 21:30:28,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:28,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134729970] [2025-01-09 21:30:28,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:28,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:28,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 21:30:28,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 21:30:28,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:28,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:29,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134729970] [2025-01-09 21:30:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134729970] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:30:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877224757] [2025-01-09 21:30:29,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:29,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:29,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:29,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:30:29,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:30:29,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 21:30:29,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 21:30:29,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:29,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:29,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 21:30:29,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:30:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:29,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:30:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:29,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877224757] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:30:29,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:30:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-01-09 21:30:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78496396] [2025-01-09 21:30:29,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:30:29,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 21:30:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:29,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 21:30:29,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-01-09 21:30:30,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 583 [2025-01-09 21:30:30,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1356 flow. Second operand has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 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:30,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 583 [2025-01-09 21:30:30,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,953 INFO L124 PetriNetUnfolderBase]: 50/2312 cut-off events. [2025-01-09 21:30:30,954 INFO L125 PetriNetUnfolderBase]: For 74/106 co-relation queries the response was YES. [2025-01-09 21:30:30,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 2312 events. 50/2312 cut-off events. For 74/106 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 13357 event pairs, 4 based on Foata normal form. 6/2101 useless extension candidates. Maximal degree in co-relation 2472. Up to 37 conditions per place. [2025-01-09 21:30:30,974 INFO L140 encePairwiseOnDemand]: 553/583 looper letters, 36 selfloop transitions, 57 changer transitions 0/577 dead transitions. [2025-01-09 21:30:30,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 577 transitions, 1686 flow [2025-01-09 21:30:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 21:30:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 21:30:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 8990 transitions. [2025-01-09 21:30:30,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.90707294924831 [2025-01-09 21:30:30,983 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1356 flow. Second operand 17 states and 8990 transitions. [2025-01-09 21:30:30,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 577 transitions, 1686 flow [2025-01-09 21:30:30,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 577 transitions, 1686 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:30,990 INFO L231 Difference]: Finished difference. Result has 565 places, 568 transitions, 1632 flow [2025-01-09 21:30:30,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1632, PETRI_PLACES=565, PETRI_TRANSITIONS=568} [2025-01-09 21:30:30,991 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 20 predicate places. [2025-01-09 21:30:30,991 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 568 transitions, 1632 flow [2025-01-09 21:30:30,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 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:30,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,993 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:30:31,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:31,196 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:31,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1017759623, now seen corresponding path program 2 times [2025-01-09 21:30:31,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521878134] [2025-01-09 21:30:31,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:30:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-01-09 21:30:31,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 402 statements. [2025-01-09 21:30:31,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:30:31,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:31,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521878134] [2025-01-09 21:30:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521878134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:31,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268890489] [2025-01-09 21:30:31,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:31,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:31,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-01-09 21:30:31,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 568 transitions, 1632 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:31,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-01-09 21:30:31,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,680 INFO L124 PetriNetUnfolderBase]: 200/4574 cut-off events. [2025-01-09 21:30:32,680 INFO L125 PetriNetUnfolderBase]: For 219/444 co-relation queries the response was YES. [2025-01-09 21:30:32,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5534 conditions, 4574 events. 200/4574 cut-off events. For 219/444 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 35116 event pairs, 18 based on Foata normal form. 17/4114 useless extension candidates. Maximal degree in co-relation 5213. Up to 147 conditions per place. [2025-01-09 21:30:32,721 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 30 selfloop transitions, 6 changer transitions 0/575 dead transitions. [2025-01-09 21:30:32,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 575 transitions, 1726 flow [2025-01-09 21:30:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2025-01-09 21:30:32,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313893653516295 [2025-01-09 21:30:32,724 INFO L175 Difference]: Start difference. First operand has 565 places, 568 transitions, 1632 flow. Second operand 6 states and 3258 transitions. [2025-01-09 21:30:32,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 575 transitions, 1726 flow [2025-01-09 21:30:32,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 575 transitions, 1648 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-01-09 21:30:32,733 INFO L231 Difference]: Finished difference. Result has 561 places, 567 transitions, 1564 flow [2025-01-09 21:30:32,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1564, PETRI_PLACES=561, PETRI_TRANSITIONS=567} [2025-01-09 21:30:32,734 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 16 predicate places. [2025-01-09 21:30:32,734 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 567 transitions, 1564 flow [2025-01-09 21:30:32,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:32,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,735 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:30:32,736 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:32,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1122759625, now seen corresponding path program 1 times [2025-01-09 21:30:32,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670249202] [2025-01-09 21:30:32,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-09 21:30:32,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-09 21:30:32,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:32,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670249202] [2025-01-09 21:30:32,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670249202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815765748] [2025-01-09 21:30:32,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-01-09 21:30:32,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 567 transitions, 1564 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:32,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-01-09 21:30:32,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,699 INFO L124 PetriNetUnfolderBase]: 386/9284 cut-off events. [2025-01-09 21:30:34,700 INFO L125 PetriNetUnfolderBase]: For 321/539 co-relation queries the response was YES. [2025-01-09 21:30:34,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10634 conditions, 9284 events. 386/9284 cut-off events. For 321/539 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 92163 event pairs, 113 based on Foata normal form. 6/8182 useless extension candidates. Maximal degree in co-relation 10121. Up to 310 conditions per place. [2025-01-09 21:30:34,781 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 18 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-01-09 21:30:34,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 568 transitions, 1608 flow [2025-01-09 21:30:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-01-09 21:30:34,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-01-09 21:30:34,786 INFO L175 Difference]: Start difference. First operand has 561 places, 567 transitions, 1564 flow. Second operand 3 states and 1663 transitions. [2025-01-09 21:30:34,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 568 transitions, 1608 flow [2025-01-09 21:30:34,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 568 transitions, 1596 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:34,794 INFO L231 Difference]: Finished difference. Result has 557 places, 566 transitions, 1554 flow [2025-01-09 21:30:34,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=557, PETRI_TRANSITIONS=566} [2025-01-09 21:30:34,794 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 12 predicate places. [2025-01-09 21:30:34,795 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 566 transitions, 1554 flow [2025-01-09 21:30:34,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:34,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,795 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:30:34,795 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:34,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1245934908, now seen corresponding path program 1 times [2025-01-09 21:30:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81070921] [2025-01-09 21:30:34,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-01-09 21:30:34,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-01-09 21:30:34,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81070921] [2025-01-09 21:30:34,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81070921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545512504] [2025-01-09 21:30:34,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 583 [2025-01-09 21:30:34,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 566 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 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:34,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 583 [2025-01-09 21:30:34,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,908 INFO L124 PetriNetUnfolderBase]: 235/4728 cut-off events. [2025-01-09 21:30:35,908 INFO L125 PetriNetUnfolderBase]: For 253/337 co-relation queries the response was YES. [2025-01-09 21:30:35,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 4728 events. 235/4728 cut-off events. For 253/337 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 38982 event pairs, 56 based on Foata normal form. 14/4236 useless extension candidates. Maximal degree in co-relation 5088. Up to 240 conditions per place. [2025-01-09 21:30:35,945 INFO L140 encePairwiseOnDemand]: 574/583 looper letters, 13 selfloop transitions, 4 changer transitions 18/567 dead transitions. [2025-01-09 21:30:35,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 567 transitions, 1600 flow [2025-01-09 21:30:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1657 transitions. [2025-01-09 21:30:35,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473985134362493 [2025-01-09 21:30:35,947 INFO L175 Difference]: Start difference. First operand has 557 places, 566 transitions, 1554 flow. Second operand 3 states and 1657 transitions. [2025-01-09 21:30:35,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 567 transitions, 1600 flow [2025-01-09 21:30:35,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 567 transitions, 1596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,953 INFO L231 Difference]: Finished difference. Result has 555 places, 547 transitions, 1529 flow [2025-01-09 21:30:35,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=555, PETRI_TRANSITIONS=547} [2025-01-09 21:30:35,954 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 10 predicate places. [2025-01-09 21:30:35,954 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 547 transitions, 1529 flow [2025-01-09 21:30:35,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 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:35,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,955 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:30:35,955 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:35,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1185592508, now seen corresponding path program 1 times [2025-01-09 21:30:35,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646164436] [2025-01-09 21:30:35,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-09 21:30:35,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-09 21:30:35,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-01-09 21:30:36,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646164436] [2025-01-09 21:30:36,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646164436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246444415] [2025-01-09 21:30:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-01-09 21:30:36,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 547 transitions, 1529 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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:36,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-01-09 21:30:36,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:38,116 INFO L124 PetriNetUnfolderBase]: 497/10766 cut-off events. [2025-01-09 21:30:38,117 INFO L125 PetriNetUnfolderBase]: For 449/459 co-relation queries the response was YES. [2025-01-09 21:30:38,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12610 conditions, 10766 events. 497/10766 cut-off events. For 449/459 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 112004 event pairs, 162 based on Foata normal form. 0/9765 useless extension candidates. Maximal degree in co-relation 12096. Up to 618 conditions per place. [2025-01-09 21:30:38,195 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-01-09 21:30:38,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 550 transitions, 1568 flow [2025-01-09 21:30:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-01-09 21:30:38,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-01-09 21:30:38,197 INFO L175 Difference]: Start difference. First operand has 555 places, 547 transitions, 1529 flow. Second operand 3 states and 1673 transitions. [2025-01-09 21:30:38,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 550 transitions, 1568 flow [2025-01-09 21:30:38,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 550 transitions, 1560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:38,206 INFO L231 Difference]: Finished difference. Result has 536 places, 547 transitions, 1531 flow [2025-01-09 21:30:38,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1531, PETRI_PLACES=536, PETRI_TRANSITIONS=547} [2025-01-09 21:30:38,207 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -9 predicate places. [2025-01-09 21:30:38,207 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 547 transitions, 1531 flow [2025-01-09 21:30:38,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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:38,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:38,209 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:30:38,209 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1442010385, now seen corresponding path program 1 times [2025-01-09 21:30:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:38,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153767409] [2025-01-09 21:30:38,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:38,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-09 21:30:38,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-09 21:30:38,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:38,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:38,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153767409] [2025-01-09 21:30:38,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153767409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:38,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:38,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655245182] [2025-01-09 21:30:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:38,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:38,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:38,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:39,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-01-09 21:30:39,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 547 transitions, 1531 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:39,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:39,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-01-09 21:30:39,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:41,023 INFO L124 PetriNetUnfolderBase]: 194/5978 cut-off events. [2025-01-09 21:30:41,024 INFO L125 PetriNetUnfolderBase]: For 147/311 co-relation queries the response was YES. [2025-01-09 21:30:41,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7080 conditions, 5978 events. 194/5978 cut-off events. For 147/311 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 47919 event pairs, 33 based on Foata normal form. 32/5504 useless extension candidates. Maximal degree in co-relation 6970. Up to 116 conditions per place. [2025-01-09 21:30:41,117 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-01-09 21:30:41,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 554 transitions, 1623 flow [2025-01-09 21:30:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-01-09 21:30:41,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-01-09 21:30:41,123 INFO L175 Difference]: Start difference. First operand has 536 places, 547 transitions, 1531 flow. Second operand 6 states and 3257 transitions. [2025-01-09 21:30:41,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 554 transitions, 1623 flow [2025-01-09 21:30:41,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 554 transitions, 1623 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:41,131 INFO L231 Difference]: Finished difference. Result has 540 places, 546 transitions, 1541 flow [2025-01-09 21:30:41,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1541, PETRI_PLACES=540, PETRI_TRANSITIONS=546} [2025-01-09 21:30:41,132 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -5 predicate places. [2025-01-09 21:30:41,132 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 546 transitions, 1541 flow [2025-01-09 21:30:41,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:41,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:41,133 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:30:41,134 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:41,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:41,135 INFO L85 PathProgramCache]: Analyzing trace with hash -508350516, now seen corresponding path program 1 times [2025-01-09 21:30:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218398966] [2025-01-09 21:30:41,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:41,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 21:30:41,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 21:30:41,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:41,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218398966] [2025-01-09 21:30:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218398966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:30:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988802272] [2025-01-09 21:30:41,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:41,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:30:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:41,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:30:41,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:30:41,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 583 [2025-01-09 21:30:41,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 546 transitions, 1541 flow. Second operand has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 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:41,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:41,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 583 [2025-01-09 21:30:41,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:42,853 INFO L124 PetriNetUnfolderBase]: 373/7895 cut-off events. [2025-01-09 21:30:42,853 INFO L125 PetriNetUnfolderBase]: For 362/424 co-relation queries the response was YES. [2025-01-09 21:30:42,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9578 conditions, 7895 events. 373/7895 cut-off events. For 362/424 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 79407 event pairs, 146 based on Foata normal form. 4/7091 useless extension candidates. Maximal degree in co-relation 9063. Up to 444 conditions per place. [2025-01-09 21:30:42,932 INFO L140 encePairwiseOnDemand]: 578/583 looper letters, 20 selfloop transitions, 4 changer transitions 0/556 dead transitions. [2025-01-09 21:30:42,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 556 transitions, 1613 flow [2025-01-09 21:30:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2780 transitions. [2025-01-09 21:30:42,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536878216123499 [2025-01-09 21:30:42,934 INFO L175 Difference]: Start difference. First operand has 540 places, 546 transitions, 1541 flow. Second operand 5 states and 2780 transitions. [2025-01-09 21:30:42,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 556 transitions, 1613 flow [2025-01-09 21:30:42,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 556 transitions, 1601 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:42,942 INFO L231 Difference]: Finished difference. Result has 542 places, 548 transitions, 1554 flow [2025-01-09 21:30:42,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=548} [2025-01-09 21:30:42,943 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2025-01-09 21:30:42,943 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 548 transitions, 1554 flow [2025-01-09 21:30:42,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 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:42,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:42,943 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:30:42,943 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:42,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1558544913, now seen corresponding path program 1 times [2025-01-09 21:30:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:42,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325945837] [2025-01-09 21:30:42,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:42,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:42,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-09 21:30:42,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-09 21:30:42,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:42,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325945837] [2025-01-09 21:30:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325945837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:43,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:43,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092539276] [2025-01-09 21:30:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:43,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:43,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:43,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:43,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-01-09 21:30:43,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 548 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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:43,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:43,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-01-09 21:30:43,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:44,861 INFO L124 PetriNetUnfolderBase]: 534/7743 cut-off events. [2025-01-09 21:30:44,862 INFO L125 PetriNetUnfolderBase]: For 830/900 co-relation queries the response was YES. [2025-01-09 21:30:44,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10197 conditions, 7743 events. 534/7743 cut-off events. For 830/900 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 80334 event pairs, 275 based on Foata normal form. 2/7077 useless extension candidates. Maximal degree in co-relation 9680. Up to 783 conditions per place. [2025-01-09 21:30:44,919 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 14 selfloop transitions, 2 changer transitions 1/549 dead transitions. [2025-01-09 21:30:44,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 549 transitions, 1592 flow [2025-01-09 21:30:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2025-01-09 21:30:44,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491137793024585 [2025-01-09 21:30:44,921 INFO L175 Difference]: Start difference. First operand has 542 places, 548 transitions, 1554 flow. Second operand 3 states and 1660 transitions. [2025-01-09 21:30:44,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 549 transitions, 1592 flow [2025-01-09 21:30:44,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 549 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:44,930 INFO L231 Difference]: Finished difference. Result has 543 places, 547 transitions, 1556 flow [2025-01-09 21:30:44,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=543, PETRI_TRANSITIONS=547} [2025-01-09 21:30:44,931 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2025-01-09 21:30:44,931 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 547 transitions, 1556 flow [2025-01-09 21:30:44,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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:44,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:44,931 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:30:44,932 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:44,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1453544911, now seen corresponding path program 1 times [2025-01-09 21:30:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:44,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299969052] [2025-01-09 21:30:44,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:44,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-09 21:30:44,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-09 21:30:44,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:44,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299969052] [2025-01-09 21:30:45,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299969052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:45,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:45,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:45,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058641844] [2025-01-09 21:30:45,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:45,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:45,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:45,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:45,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:45,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-01-09 21:30:45,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 547 transitions, 1556 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:45,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:45,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-01-09 21:30:45,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:47,308 INFO L124 PetriNetUnfolderBase]: 363/7609 cut-off events. [2025-01-09 21:30:47,308 INFO L125 PetriNetUnfolderBase]: For 675/765 co-relation queries the response was YES. [2025-01-09 21:30:47,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9897 conditions, 7609 events. 363/7609 cut-off events. For 675/765 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 75666 event pairs, 64 based on Foata normal form. 8/7100 useless extension candidates. Maximal degree in co-relation 9317. Up to 224 conditions per place. [2025-01-09 21:30:47,372 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-01-09 21:30:47,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 554 transitions, 1648 flow [2025-01-09 21:30:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-01-09 21:30:47,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-01-09 21:30:47,375 INFO L175 Difference]: Start difference. First operand has 543 places, 547 transitions, 1556 flow. Second operand 6 states and 3257 transitions. [2025-01-09 21:30:47,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 554 transitions, 1648 flow [2025-01-09 21:30:47,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 554 transitions, 1644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:47,384 INFO L231 Difference]: Finished difference. Result has 545 places, 546 transitions, 1562 flow [2025-01-09 21:30:47,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=545, PETRI_TRANSITIONS=546} [2025-01-09 21:30:47,385 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 0 predicate places. [2025-01-09 21:30:47,385 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 546 transitions, 1562 flow [2025-01-09 21:30:47,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:47,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:47,386 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:30:47,386 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:47,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:47,387 INFO L85 PathProgramCache]: Analyzing trace with hash -277665600, now seen corresponding path program 1 times [2025-01-09 21:30:47,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:47,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940187651] [2025-01-09 21:30:47,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:47,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:47,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-01-09 21:30:47,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-01-09 21:30:47,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:47,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-01-09 21:30:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:47,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940187651] [2025-01-09 21:30:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940187651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:47,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520687812] [2025-01-09 21:30:47,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:47,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:47,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:47,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:48,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-01-09 21:30:48,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 546 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:48,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:48,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-01-09 21:30:48,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1435] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~o_4~0.base=v_~o_4~0.base_2, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~o_4~0.base=v_~o_4~0.base_2, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][380], [620#true, 3928#(= |#race~o_4~0| 0), 3956#(= (select (select |#race| ~o_4~0.base) (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) ~o_4~0.offset)) 0), Black: 3882#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), Black: 3902#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 1989#(and (not (= (mod |thread2Thread1of1ForFork0_~stop~1#1| 256) 0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 3908#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1986#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3923#(= |#race~result_13~0| 0), Black: 597#true, Black: 3926#true, 257#L82-9true, 256#L104-1true, Black: 604#true, Black: 608#true, 1984#true, Black: 3936#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 1945#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1953#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1959#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 617#(= |#race~result_7~0| 0), 52#L68-12true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), Black: 625#(and (not (= (mod |thread1Thread1of1ForFork2_~stop~0#1| 256) 0)) (= |thread1Thread1of1ForFork2_~i~0#1| 0)), 599#(= |#race~isNull_3~0| 0), Black: 622#(= |thread1Thread1of1ForFork2_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-01-09 21:30:49,656 INFO L294 olderBase$Statistics]: this new event has 684 ancestors and is cut-off event [2025-01-09 21:30:49,657 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2025-01-09 21:30:49,657 INFO L297 olderBase$Statistics]: existing Event has 578 ancestors and is cut-off event [2025-01-09 21:30:49,657 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2025-01-09 21:30:49,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1435] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~o_4~0.base=v_~o_4~0.base_2, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~o_4~0.base=v_~o_4~0.base_2, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][380], [3928#(= |#race~o_4~0| 0), 3956#(= (select (select |#race| ~o_4~0.base) (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) ~o_4~0.offset)) 0), 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), Black: 3882#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3902#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 1989#(and (not (= (mod |thread2Thread1of1ForFork0_~stop~1#1| 256) 0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 3908#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1986#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3923#(= |#race~result_13~0| 0), Black: 597#true, 257#L82-9true, Black: 3926#true, Black: 604#true, 256#L104-1true, 623#(not (= (mod |thread1Thread1of1ForFork2_~stop~0#1| 256) 0)), Black: 608#true, 1984#true, Black: 3936#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 1945#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1953#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1959#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 617#(= |#race~result_7~0| 0), 52#L68-12true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), Black: 620#true, 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (not (= (mod |thread1Thread1of1ForFork2_~stop~0#1| 256) 0)) (= |thread1Thread1of1ForFork2_~i~0#1| 0)), Black: 622#(= |thread1Thread1of1ForFork2_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-01-09 21:30:49,660 INFO L294 olderBase$Statistics]: this new event has 686 ancestors and is cut-off event [2025-01-09 21:30:49,660 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2025-01-09 21:30:49,661 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2025-01-09 21:30:49,661 INFO L297 olderBase$Statistics]: existing Event has 580 ancestors and is cut-off event [2025-01-09 21:30:49,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1435] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~o_4~0.base=v_~o_4~0.base_2, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~o_4~0.base=v_~o_4~0.base_2, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][380], [620#true, 3928#(= |#race~o_4~0| 0), 3956#(= (select (select |#race| ~o_4~0.base) (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) ~o_4~0.offset)) 0), Black: 3882#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3902#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 1989#(and (not (= (mod |thread2Thread1of1ForFork0_~stop~1#1| 256) 0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 3908#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1986#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3921#true, Black: 597#true, Black: 3926#true, 257#L82-9true, Black: 604#true, 256#L104-1true, Black: 608#true, 1984#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 1945#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), Black: 1953#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1959#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 617#(= |#race~result_7~0| 0), 52#L68-12true, 3936#true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (not (= (mod |thread1Thread1of1ForFork2_~stop~0#1| 256) 0)) (= |thread1Thread1of1ForFork2_~i~0#1| 0)), Black: 622#(= |thread1Thread1of1ForFork2_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-01-09 21:30:49,721 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-01-09 21:30:49,721 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2025-01-09 21:30:49,721 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2025-01-09 21:30:49,721 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2025-01-09 21:30:49,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1435] L68-11-->L68-12: Formula: (= (store |v_#race_32| v_~o_4~0.base_2 (store (select |v_#race_32| v_~o_4~0.base_2) (+ v_~o_4~0.offset_2 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4)) 0)) |v_#race_31|) InVars {#race=|v_#race_32|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~o_4~0.base=v_~o_4~0.base_2, ~o_4~0.offset=v_~o_4~0.offset_2} OutVars{#race=|v_#race_31|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~o_4~0.base=v_~o_4~0.base_2, ~o_4~0.offset=v_~o_4~0.offset_2} AuxVars[] AssignedVars[#race][380], [3928#(= |#race~o_4~0| 0), 3956#(= (select (select |#race| ~o_4~0.base) (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) ~o_4~0.offset)) 0), Black: 3882#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3902#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 1989#(and (not (= (mod |thread2Thread1of1ForFork0_~stop~1#1| 256) 0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 3908#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1986#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3921#true, Black: 597#true, Black: 3926#true, 257#L82-9true, 256#L104-1true, Black: 604#true, 623#(not (= (mod |thread1Thread1of1ForFork2_~stop~0#1| 256) 0)), Black: 608#true, 1984#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), Black: 1945#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1953#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 617#(= |#race~result_7~0| 0), Black: 1959#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 52#L68-12true, 3936#true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), Black: 620#true, 599#(= |#race~isNull_3~0| 0), Black: 625#(and (not (= (mod |thread1Thread1of1ForFork2_~stop~0#1| 256) 0)) (= |thread1Thread1of1ForFork2_~i~0#1| 0)), Black: 622#(= |thread1Thread1of1ForFork2_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-01-09 21:30:49,722 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-01-09 21:30:49,722 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2025-01-09 21:30:49,722 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2025-01-09 21:30:49,722 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2025-01-09 21:30:49,722 INFO L124 PetriNetUnfolderBase]: 331/7564 cut-off events. [2025-01-09 21:30:49,722 INFO L125 PetriNetUnfolderBase]: For 463/512 co-relation queries the response was YES. [2025-01-09 21:30:49,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9684 conditions, 7564 events. 331/7564 cut-off events. For 463/512 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 68448 event pairs, 39 based on Foata normal form. 0/7058 useless extension candidates. Maximal degree in co-relation 9468. Up to 169 conditions per place. [2025-01-09 21:30:49,835 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/553 dead transitions. [2025-01-09 21:30:49,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 553 transitions, 1654 flow [2025-01-09 21:30:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-01-09 21:30:49,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-01-09 21:30:49,837 INFO L175 Difference]: Start difference. First operand has 545 places, 546 transitions, 1562 flow. Second operand 6 states and 3257 transitions. [2025-01-09 21:30:49,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 553 transitions, 1654 flow [2025-01-09 21:30:49,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 553 transitions, 1642 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:49,846 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1560 flow [2025-01-09 21:30:49,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2025-01-09 21:30:49,847 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -1 predicate places. [2025-01-09 21:30:49,847 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1560 flow [2025-01-09 21:30:49,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:49,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,848 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:30:49,848 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:49,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash -8239624, now seen corresponding path program 1 times [2025-01-09 21:30:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609944686] [2025-01-09 21:30:49,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-01-09 21:30:49,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-01-09 21:30:49,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609944686] [2025-01-09 21:30:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609944686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:50,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:50,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707456317] [2025-01-09 21:30:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:50,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:50,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:50,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:50,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:50,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-01-09 21:30:50,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1560 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:50,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:50,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-01-09 21:30:50,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,328 INFO L124 PetriNetUnfolderBase]: 413/7689 cut-off events. [2025-01-09 21:30:52,329 INFO L125 PetriNetUnfolderBase]: For 651/741 co-relation queries the response was YES. [2025-01-09 21:30:52,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9999 conditions, 7689 events. 413/7689 cut-off events. For 651/741 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 77316 event pairs, 62 based on Foata normal form. 16/7268 useless extension candidates. Maximal degree in co-relation 9420. Up to 276 conditions per place. [2025-01-09 21:30:52,444 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2025-01-09 21:30:52,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 552 transitions, 1652 flow [2025-01-09 21:30:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-01-09 21:30:52,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-01-09 21:30:52,447 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1560 flow. Second operand 6 states and 3257 transitions. [2025-01-09 21:30:52,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 552 transitions, 1652 flow [2025-01-09 21:30:52,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 552 transitions, 1640 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:52,456 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1558 flow [2025-01-09 21:30:52,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2025-01-09 21:30:52,458 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2025-01-09 21:30:52,458 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1558 flow [2025-01-09 21:30:52,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:52,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,458 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:30:52,459 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:52,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1858149087, now seen corresponding path program 1 times [2025-01-09 21:30:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893643004] [2025-01-09 21:30:52,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 21:30:52,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 21:30:52,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-01-09 21:30:52,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:52,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893643004] [2025-01-09 21:30:52,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893643004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:52,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:52,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322363588] [2025-01-09 21:30:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:52,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:52,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:52,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:52,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:52,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 583 [2025-01-09 21:30:52,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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:52,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:52,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 583 [2025-01-09 21:30:52,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:54,365 INFO L124 PetriNetUnfolderBase]: 180/7839 cut-off events. [2025-01-09 21:30:54,366 INFO L125 PetriNetUnfolderBase]: For 322/508 co-relation queries the response was YES. [2025-01-09 21:30:54,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9862 conditions, 7839 events. 180/7839 cut-off events. For 322/508 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 71648 event pairs, 69 based on Foata normal form. 6/7496 useless extension candidates. Maximal degree in co-relation 9594. Up to 166 conditions per place. [2025-01-09 21:30:54,459 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 14 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2025-01-09 21:30:54,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 545 transitions, 1596 flow [2025-01-09 21:30:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-01-09 21:30:54,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-01-09 21:30:54,460 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1558 flow. Second operand 3 states and 1663 transitions. [2025-01-09 21:30:54,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 545 transitions, 1596 flow [2025-01-09 21:30:54,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1584 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:54,470 INFO L231 Difference]: Finished difference. Result has 539 places, 543 transitions, 1550 flow [2025-01-09 21:30:54,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=539, PETRI_TRANSITIONS=543} [2025-01-09 21:30:54,471 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2025-01-09 21:30:54,471 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 543 transitions, 1550 flow [2025-01-09 21:30:54,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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:54,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:54,472 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:30:54,472 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:54,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1894644880, now seen corresponding path program 1 times [2025-01-09 21:30:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:54,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972674264] [2025-01-09 21:30:54,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:54,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 21:30:54,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 21:30:54,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:54,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2025-01-09 21:30:54,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:54,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972674264] [2025-01-09 21:30:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972674264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:54,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327055020] [2025-01-09 21:30:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:54,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:54,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:54,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:54,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:54,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-01-09 21:30:54,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 543 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:54,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:54,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-01-09 21:30:54,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:57,013 INFO L124 PetriNetUnfolderBase]: 468/9815 cut-off events. [2025-01-09 21:30:57,014 INFO L125 PetriNetUnfolderBase]: For 574/648 co-relation queries the response was YES. [2025-01-09 21:30:57,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12366 conditions, 9815 events. 468/9815 cut-off events. For 574/648 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 99401 event pairs, 177 based on Foata normal form. 0/9279 useless extension candidates. Maximal degree in co-relation 11848. Up to 516 conditions per place. [2025-01-09 21:30:57,114 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 14 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2025-01-09 21:30:57,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1588 flow [2025-01-09 21:30:57,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2025-01-09 21:30:57,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491137793024585 [2025-01-09 21:30:57,116 INFO L175 Difference]: Start difference. First operand has 539 places, 543 transitions, 1550 flow. Second operand 3 states and 1660 transitions. [2025-01-09 21:30:57,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1588 flow [2025-01-09 21:30:57,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:57,126 INFO L231 Difference]: Finished difference. Result has 538 places, 542 transitions, 1548 flow [2025-01-09 21:30:57,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=538, PETRI_TRANSITIONS=542} [2025-01-09 21:30:57,129 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -7 predicate places. [2025-01-09 21:30:57,129 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 542 transitions, 1548 flow [2025-01-09 21:30:57,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:57,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:57,129 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:30:57,130 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:30:57,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:57,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1461902840, now seen corresponding path program 1 times [2025-01-09 21:30:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:57,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093030184] [2025-01-09 21:30:57,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:57,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-09 21:30:57,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-09 21:30:57,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:57,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093030184] [2025-01-09 21:30:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093030184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:57,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:57,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169744207] [2025-01-09 21:30:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:57,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:57,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:57,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:57,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:57,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-01-09 21:30:57,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 542 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:57,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:57,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-01-09 21:30:57,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:58,981 INFO L124 PetriNetUnfolderBase]: 493/7668 cut-off events. [2025-01-09 21:30:58,981 INFO L125 PetriNetUnfolderBase]: For 731/777 co-relation queries the response was YES. [2025-01-09 21:30:59,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10078 conditions, 7668 events. 493/7668 cut-off events. For 731/777 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 79058 event pairs, 260 based on Foata normal form. 0/7276 useless extension candidates. Maximal degree in co-relation 9560. Up to 746 conditions per place. [2025-01-09 21:30:59,073 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 0 selfloop transitions, 0 changer transitions 543/543 dead transitions. [2025-01-09 21:30:59,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 543 transitions, 1586 flow [2025-01-09 21:30:59,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2025-01-09 21:30:59,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491137793024585 [2025-01-09 21:30:59,075 INFO L175 Difference]: Start difference. First operand has 538 places, 542 transitions, 1548 flow. Second operand 3 states and 1660 transitions. [2025-01-09 21:30:59,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 543 transitions, 1586 flow [2025-01-09 21:30:59,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 543 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:59,082 INFO L231 Difference]: Finished difference. Result has 537 places, 0 transitions, 0 flow [2025-01-09 21:30:59,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=537, PETRI_TRANSITIONS=0} [2025-01-09 21:30:59,083 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -8 predicate places. [2025-01-09 21:30:59,083 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 0 transitions, 0 flow [2025-01-09 21:30:59,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:59,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (82 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (81 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (80 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (79 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (75 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (72 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (71 of 83 remaining) [2025-01-09 21:30:59,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (70 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (68 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (67 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (66 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (64 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (63 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (60 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (59 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (58 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (57 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (56 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (55 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (54 of 83 remaining) [2025-01-09 21:30:59,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (53 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (52 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (49 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (48 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (47 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (46 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (43 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (42 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (41 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (40 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (38 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (37 of 83 remaining) [2025-01-09 21:30:59,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (36 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (28 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (27 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 83 remaining) [2025-01-09 21:30:59,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (17 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (16 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (15 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (12 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (7 of 83 remaining) [2025-01-09 21:30:59,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 83 remaining) [2025-01-09 21:30:59,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 83 remaining) [2025-01-09 21:30:59,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 83 remaining) [2025-01-09 21:30:59,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 83 remaining) [2025-01-09 21:30:59,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 83 remaining) [2025-01-09 21:30:59,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (1 of 83 remaining) [2025-01-09 21:30:59,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (0 of 83 remaining) [2025-01-09 21:30:59,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:30:59,091 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:59,102 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:59,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:59,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:59 BasicIcfg [2025-01-09 21:30:59,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:59,108 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:59,108 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:59,109 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:59,109 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:14" (3/4) ... [2025-01-09 21:30:59,110 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:59,113 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:59,113 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:59,113 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:30:59,118 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-01-09 21:30:59,119 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:59,119 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:59,120 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:59,194 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:59,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:59,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:59,196 INFO L158 Benchmark]: Toolchain (without parser) took 46046.95ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 113.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-09 21:30:59,196 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:59,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.98ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 100.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:30:59,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.35ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 97.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:59,197 INFO L158 Benchmark]: Boogie Preprocessor took 52.94ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:59,197 INFO L158 Benchmark]: RCFGBuilder took 643.70ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 53.6MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 21:30:59,198 INFO L158 Benchmark]: TraceAbstraction took 44986.80ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 52.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-09 21:30:59,198 INFO L158 Benchmark]: Witness Printer took 86.65ms. Allocated memory is still 3.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:59,199 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.98ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 100.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.35ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 97.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.94ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 643.70ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 53.6MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 44986.80ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 52.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 86.65ms. Allocated memory is still 3.0GB. Free memory was 1.3GB in the beginning and 1.3GB 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: 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: 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: 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: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 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: 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: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 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: 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: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: 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: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: 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 7 procedures, 857 locations, 83 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: 44.8s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 37.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3959 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2597 mSDsluCounter, 1300 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1104 mSDsCounter, 731 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6846 IncrementalHoareTripleChecker+Invalid, 7577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 731 mSolverCounterUnsat, 196 mSDtfsCounter, 6846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 1078 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1632occurred in iteration=24, InterpolantAutomatonStates: 162, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 10417 NumberOfCodeBlocks, 10057 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10904 ConstructedInterpolants, 0 QuantifiedInterpolants, 12966 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 7222/7369 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 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:59,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE