./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp3x3-opt.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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:48,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:48,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:29:48,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:48,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:48,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:48,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:48,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:48,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:48,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:48,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:48,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:48,316 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:48,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:48,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:48,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:48,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:48,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:48,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:48,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:48,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:48,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:48,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:48,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:48,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:48,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:48,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:48,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:48,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:48,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:48,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:48,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:48,318 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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2025-01-09 21:29:48,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:48,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:48,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:48,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:48,591 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:48,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-01-09 21:29:49,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b47fcc45/052b289d7f4a4d83a13f071aa8a27114/FLAG1efa868be [2025-01-09 21:29:50,069 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:50,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-01-09 21:29:50,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b47fcc45/052b289d7f4a4d83a13f071aa8a27114/FLAG1efa868be [2025-01-09 21:29:50,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b47fcc45/052b289d7f4a4d83a13f071aa8a27114 [2025-01-09 21:29:50,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:50,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:50,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:50,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:50,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:50,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27194523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50, skipping insertion in model container [2025-01-09 21:29:50,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:50,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:50,342 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:50,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:50,373 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:50,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50 WrapperNode [2025-01-09 21:29:50,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:50,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:50,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:50,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:50,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,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:29:50" (1/1) ... [2025-01-09 21:29:50,396 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 213 [2025-01-09 21:29:50,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:50,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:50,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:50,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:50,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:50,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:50,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:50,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:50,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (1/1) ... [2025-01-09 21:29:50,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:50,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:50,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:29:50,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:29:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:29:50,461 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:29:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:29:50,461 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:29:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:29:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:29:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:29:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:29:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-09 21:29:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-09 21:29:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-01-09 21:29:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-01-09 21:29:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:50,463 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:29:50,532 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:50,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:50,922 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:50,922 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:50,944 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:50,947 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-09 21:29:50,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:50 BoogieIcfgContainer [2025-01-09 21:29:50,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:50,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:50,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:50,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:50,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:50" (1/3) ... [2025-01-09 21:29:50,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5088d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:50, skipping insertion in model container [2025-01-09 21:29:50,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:50" (2/3) ... [2025-01-09 21:29:50,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5088d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:50, skipping insertion in model container [2025-01-09 21:29:50,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:50" (3/3) ... [2025-01-09 21:29:50,956 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2025-01-09 21:29:50,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:50,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 392 locations, 1 initial locations, 6 loop locations, and 61 error locations. [2025-01-09 21:29:50,970 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:51,067 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-01-09 21:29:51,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 415 transitions, 872 flow [2025-01-09 21:29:51,245 INFO L124 PetriNetUnfolderBase]: 24/409 cut-off events. [2025-01-09 21:29:51,248 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:29:51,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 409 events. 24/409 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 819 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2025-01-09 21:29:51,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 415 transitions, 872 flow [2025-01-09 21:29:51,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 382 transitions, 800 flow [2025-01-09 21:29:51,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:51,282 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;@12d1ea7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:51,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2025-01-09 21:29:51,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:51,289 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:29:51,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:51,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,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] [2025-01-09 21:29:51,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:51,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1024146303, now seen corresponding path program 1 times [2025-01-09 21:29:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679423695] [2025-01-09 21:29:51,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:29:51,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:29:51,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:51,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679423695] [2025-01-09 21:29:51,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679423695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:51,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:51,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:51,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193887846] [2025-01-09 21:29:51,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:51,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:51,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:51,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:51,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:51,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-01-09 21:29:51,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:51,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:51,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-01-09 21:29:51,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:51,646 INFO L124 PetriNetUnfolderBase]: 40/509 cut-off events. [2025-01-09 21:29:51,647 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:29:51,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 509 events. 40/509 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1836 event pairs, 20 based on Foata normal form. 91/490 useless extension candidates. Maximal degree in co-relation 460. Up to 68 conditions per place. [2025-01-09 21:29:51,652 INFO L140 encePairwiseOnDemand]: 405/415 looper letters, 22 selfloop transitions, 2 changer transitions 1/374 dead transitions. [2025-01-09 21:29:51,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 374 transitions, 832 flow [2025-01-09 21:29:51,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-01-09 21:29:51,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-01-09 21:29:51,665 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 800 flow. Second operand 3 states and 1172 transitions. [2025-01-09 21:29:51,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 374 transitions, 832 flow [2025-01-09 21:29:51,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 808 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-09 21:29:51,675 INFO L231 Difference]: Finished difference. Result has 368 places, 373 transitions, 762 flow [2025-01-09 21:29:51,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=368, PETRI_TRANSITIONS=373} [2025-01-09 21:29:51,679 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -11 predicate places. [2025-01-09 21:29:51,679 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 373 transitions, 762 flow [2025-01-09 21:29:51,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:51,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,687 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] [2025-01-09 21:29:51,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:51,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:51,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash 854044592, now seen corresponding path program 1 times [2025-01-09 21:29:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444819764] [2025-01-09 21:29:51,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:29:51,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:29:51,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:51,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:51,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444819764] [2025-01-09 21:29:51,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444819764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:51,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:51,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:51,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299221321] [2025-01-09 21:29:51,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:51,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:51,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:51,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:51,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:51,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-01-09 21:29:51,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 373 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:51,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:51,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-01-09 21:29:51,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:51,938 INFO L124 PetriNetUnfolderBase]: 40/507 cut-off events. [2025-01-09 21:29:51,938 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:29:51,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 507 events. 40/507 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1732 event pairs, 20 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 569. Up to 68 conditions per place. [2025-01-09 21:29:51,944 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-01-09 21:29:51,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 808 flow [2025-01-09 21:29:51,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:29:51,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-01-09 21:29:51,948 INFO L175 Difference]: Start difference. First operand has 368 places, 373 transitions, 762 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:29:51,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 808 flow [2025-01-09 21:29:51,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:51,953 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 760 flow [2025-01-09 21:29:51,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2025-01-09 21:29:51,954 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -13 predicate places. [2025-01-09 21:29:51,954 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 760 flow [2025-01-09 21:29:51,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:51,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,955 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] [2025-01-09 21:29:51,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:51,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:51,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash -427447794, now seen corresponding path program 1 times [2025-01-09 21:29:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086308963] [2025-01-09 21:29:51,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:29:51,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:29:51,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:52,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:52,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086308963] [2025-01-09 21:29:52,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086308963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:52,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:52,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:52,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111851034] [2025-01-09 21:29:52,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:52,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:52,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:52,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:52,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:52,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-01-09 21:29:52,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:52,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-01-09 21:29:52,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:52,120 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2025-01-09 21:29:52,120 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:29:52,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 488 events. 40/488 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1589 event pairs, 20 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 539. Up to 68 conditions per place. [2025-01-09 21:29:52,124 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-01-09 21:29:52,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 371 transitions, 806 flow [2025-01-09 21:29:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:29:52,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-01-09 21:29:52,128 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 760 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:29:52,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 371 transitions, 806 flow [2025-01-09 21:29:52,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:52,131 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 758 flow [2025-01-09 21:29:52,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2025-01-09 21:29:52,132 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -14 predicate places. [2025-01-09 21:29:52,133 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 758 flow [2025-01-09 21:29:52,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:52,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:52,134 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] [2025-01-09 21:29:52,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:52,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:52,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1322024631, now seen corresponding path program 1 times [2025-01-09 21:29:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:52,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55781367] [2025-01-09 21:29:52,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:52,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:52,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:29:52,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:29:52,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:52,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:52,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:52,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55781367] [2025-01-09 21:29:52,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55781367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:52,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:52,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808818507] [2025-01-09 21:29:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:52,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:52,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:52,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:52,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-01-09 21:29:52,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:52,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-01-09 21:29:52,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:52,256 INFO L124 PetriNetUnfolderBase]: 40/469 cut-off events. [2025-01-09 21:29:52,256 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:29:52,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 469 events. 40/469 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1402 event pairs, 20 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 509. Up to 68 conditions per place. [2025-01-09 21:29:52,262 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-01-09 21:29:52,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 370 transitions, 804 flow [2025-01-09 21:29:52,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:29:52,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-01-09 21:29:52,266 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 758 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:29:52,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 370 transitions, 804 flow [2025-01-09 21:29:52,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 370 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:52,270 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 756 flow [2025-01-09 21:29:52,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2025-01-09 21:29:52,272 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -15 predicate places. [2025-01-09 21:29:52,272 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 756 flow [2025-01-09 21:29:52,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:52,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:52,273 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:52,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:52,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:52,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1994124702, now seen corresponding path program 1 times [2025-01-09 21:29:52,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:52,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838400617] [2025-01-09 21:29:52,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:52,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:29:52,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:29:52,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838400617] [2025-01-09 21:29:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838400617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:52,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840154741] [2025-01-09 21:29:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:52,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:52,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:52,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:52,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-01-09 21:29:52,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:52,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-01-09 21:29:52,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:52,411 INFO L124 PetriNetUnfolderBase]: 40/450 cut-off events. [2025-01-09 21:29:52,411 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:29:52,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 450 events. 40/450 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1222 event pairs, 20 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 479. Up to 68 conditions per place. [2025-01-09 21:29:52,415 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-01-09 21:29:52,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 369 transitions, 802 flow [2025-01-09 21:29:52,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:29:52,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-01-09 21:29:52,418 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 756 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:29:52,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 369 transitions, 802 flow [2025-01-09 21:29:52,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 369 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:52,421 INFO L231 Difference]: Finished difference. Result has 363 places, 369 transitions, 754 flow [2025-01-09 21:29:52,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=363, PETRI_TRANSITIONS=369} [2025-01-09 21:29:52,422 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -16 predicate places. [2025-01-09 21:29:52,422 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 369 transitions, 754 flow [2025-01-09 21:29:52,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:52,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:52,423 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] [2025-01-09 21:29:52,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:52,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:52,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2125455126, now seen corresponding path program 1 times [2025-01-09 21:29:52,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:52,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032996705] [2025-01-09 21:29:52,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:52,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:52,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:29:52,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:29:52,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:52,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032996705] [2025-01-09 21:29:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032996705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:52,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:52,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234430619] [2025-01-09 21:29:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:52,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:52,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:52,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:52,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:52,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-01-09 21:29:52,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 369 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:52,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-01-09 21:29:52,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:52,543 INFO L124 PetriNetUnfolderBase]: 40/431 cut-off events. [2025-01-09 21:29:52,543 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:29:52,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 431 events. 40/431 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1060 event pairs, 20 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 449. Up to 68 conditions per place. [2025-01-09 21:29:52,547 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-01-09 21:29:52,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 368 transitions, 800 flow [2025-01-09 21:29:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:29:52,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-01-09 21:29:52,550 INFO L175 Difference]: Start difference. First operand has 363 places, 369 transitions, 754 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:29:52,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 368 transitions, 800 flow [2025-01-09 21:29:52,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 368 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:52,554 INFO L231 Difference]: Finished difference. Result has 362 places, 368 transitions, 752 flow [2025-01-09 21:29:52,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=362, PETRI_TRANSITIONS=368} [2025-01-09 21:29:52,555 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -17 predicate places. [2025-01-09 21:29:52,555 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 368 transitions, 752 flow [2025-01-09 21:29:52,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:52,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:52,556 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] [2025-01-09 21:29:52,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:52,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:52,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2083684682, now seen corresponding path program 1 times [2025-01-09 21:29:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:52,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699500242] [2025-01-09 21:29:52,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:52,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:29:52,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:29:52,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:52,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:52,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699500242] [2025-01-09 21:29:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699500242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:52,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:52,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:52,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728837398] [2025-01-09 21:29:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:52,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:52,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:52,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:52,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 415 [2025-01-09 21:29:52,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 368 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:52,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 415 [2025-01-09 21:29:52,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:53,194 INFO L124 PetriNetUnfolderBase]: 758/4767 cut-off events. [2025-01-09 21:29:53,194 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 21:29:53,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 4767 events. 758/4767 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 46194 event pairs, 387 based on Foata normal form. 0/3500 useless extension candidates. Maximal degree in co-relation 5709. Up to 942 conditions per place. [2025-01-09 21:29:53,241 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 27 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-01-09 21:29:53,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 367 transitions, 808 flow [2025-01-09 21:29:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2025-01-09 21:29:53,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927710843373494 [2025-01-09 21:29:53,243 INFO L175 Difference]: Start difference. First operand has 362 places, 368 transitions, 752 flow. Second operand 3 states and 1155 transitions. [2025-01-09 21:29:53,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 367 transitions, 808 flow [2025-01-09 21:29:53,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 367 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:53,247 INFO L231 Difference]: Finished difference. Result has 361 places, 367 transitions, 750 flow [2025-01-09 21:29:53,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=361, PETRI_TRANSITIONS=367} [2025-01-09 21:29:53,248 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -18 predicate places. [2025-01-09 21:29:53,248 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 367 transitions, 750 flow [2025-01-09 21:29:53,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:53,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:53,248 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] [2025-01-09 21:29:53,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:29:53,248 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:53,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:53,249 INFO L85 PathProgramCache]: Analyzing trace with hash -796584280, now seen corresponding path program 1 times [2025-01-09 21:29:53,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:53,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461381312] [2025-01-09 21:29:53,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:53,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:53,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 21:29:53,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 21:29:53,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:53,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:53,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461381312] [2025-01-09 21:29:53,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461381312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:53,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:53,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559581271] [2025-01-09 21:29:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:53,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:53,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:53,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:53,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-01-09 21:29:53,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 367 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:53,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:53,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-01-09 21:29:53,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:53,384 INFO L124 PetriNetUnfolderBase]: 55/497 cut-off events. [2025-01-09 21:29:53,384 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:29:53,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 497 events. 55/497 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1873 event pairs, 30 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 569. Up to 90 conditions per place. [2025-01-09 21:29:53,387 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/367 dead transitions. [2025-01-09 21:29:53,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 819 flow [2025-01-09 21:29:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2025-01-09 21:29:53,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2025-01-09 21:29:53,389 INFO L175 Difference]: Start difference. First operand has 361 places, 367 transitions, 750 flow. Second operand 3 states and 1160 transitions. [2025-01-09 21:29:53,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 819 flow [2025-01-09 21:29:53,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:53,395 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 747 flow [2025-01-09 21:29:53,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=356, PETRI_TRANSITIONS=362} [2025-01-09 21:29:53,395 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -23 predicate places. [2025-01-09 21:29:53,396 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 747 flow [2025-01-09 21:29:53,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:53,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:53,396 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] [2025-01-09 21:29:53,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:29:53,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:53,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:53,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1013288607, now seen corresponding path program 1 times [2025-01-09 21:29:53,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:53,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453024268] [2025-01-09 21:29:53,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:53,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:53,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:29:53,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:29:53,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:53,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:53,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:53,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453024268] [2025-01-09 21:29:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453024268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:53,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:53,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:53,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784950214] [2025-01-09 21:29:53,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:53,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:53,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:53,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:53,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:53,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-01-09 21:29:53,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 362 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:53,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:53,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-01-09 21:29:53,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:53,512 INFO L124 PetriNetUnfolderBase]: 55/492 cut-off events. [2025-01-09 21:29:53,512 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:29:53,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 492 events. 55/492 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1809 event pairs, 30 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 552. Up to 90 conditions per place. [2025-01-09 21:29:53,517 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/362 dead transitions. [2025-01-09 21:29:53,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 362 transitions, 816 flow [2025-01-09 21:29:53,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2025-01-09 21:29:53,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2025-01-09 21:29:53,520 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 747 flow. Second operand 3 states and 1160 transitions. [2025-01-09 21:29:53,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 362 transitions, 816 flow [2025-01-09 21:29:53,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 362 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:53,524 INFO L231 Difference]: Finished difference. Result has 352 places, 357 transitions, 745 flow [2025-01-09 21:29:53,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=352, PETRI_TRANSITIONS=357} [2025-01-09 21:29:53,525 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -27 predicate places. [2025-01-09 21:29:53,525 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 357 transitions, 745 flow [2025-01-09 21:29:53,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:53,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:53,526 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] [2025-01-09 21:29:53,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:29:53,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:53,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:53,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1514980717, now seen corresponding path program 1 times [2025-01-09 21:29:53,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:53,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998402747] [2025-01-09 21:29:53,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:53,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:53,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:29:53,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:29:53,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:53,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:53,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998402747] [2025-01-09 21:29:53,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998402747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:53,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:53,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:53,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329751547] [2025-01-09 21:29:53,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:53,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:53,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:53,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:53,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-01-09 21:29:53,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 357 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:53,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:53,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-01-09 21:29:53,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:53,715 INFO L124 PetriNetUnfolderBase]: 66/657 cut-off events. [2025-01-09 21:29:53,715 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:29:53,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 657 events. 66/657 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2920 event pairs, 5 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 729. Up to 95 conditions per place. [2025-01-09 21:29:53,721 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 32 selfloop transitions, 3 changer transitions 0/360 dead transitions. [2025-01-09 21:29:53,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 360 transitions, 829 flow [2025-01-09 21:29:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-01-09 21:29:53,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934136546184739 [2025-01-09 21:29:53,723 INFO L175 Difference]: Start difference. First operand has 352 places, 357 transitions, 745 flow. Second operand 3 states and 1163 transitions. [2025-01-09 21:29:53,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 360 transitions, 829 flow [2025-01-09 21:29:53,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 360 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:53,728 INFO L231 Difference]: Finished difference. Result has 348 places, 352 transitions, 743 flow [2025-01-09 21:29:53,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=348, PETRI_TRANSITIONS=352} [2025-01-09 21:29:53,728 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -31 predicate places. [2025-01-09 21:29:53,729 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 352 transitions, 743 flow [2025-01-09 21:29:53,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:53,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:53,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:53,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:29:53,729 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:53,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash 93717617, now seen corresponding path program 1 times [2025-01-09 21:29:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:53,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501677975] [2025-01-09 21:29:53,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:53,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:29:53,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:29:53,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:53,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501677975] [2025-01-09 21:29:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501677975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788733106] [2025-01-09 21:29:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:53,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:53,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:53,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-01-09 21:29:53,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 352 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:53,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:53,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-01-09 21:29:53,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:53,954 INFO L124 PetriNetUnfolderBase]: 105/1026 cut-off events. [2025-01-09 21:29:53,954 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 21:29:53,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1026 events. 105/1026 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5801 event pairs, 40 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 896. Up to 154 conditions per place. [2025-01-09 21:29:53,965 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 34 selfloop transitions, 3 changer transitions 0/357 dead transitions. [2025-01-09 21:29:53,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 357 transitions, 837 flow [2025-01-09 21:29:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:29:53,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-01-09 21:29:53,968 INFO L175 Difference]: Start difference. First operand has 348 places, 352 transitions, 743 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:29:53,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 357 transitions, 837 flow [2025-01-09 21:29:53,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 357 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:53,975 INFO L231 Difference]: Finished difference. Result has 344 places, 347 transitions, 741 flow [2025-01-09 21:29:53,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=344, PETRI_TRANSITIONS=347} [2025-01-09 21:29:53,976 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -35 predicate places. [2025-01-09 21:29:53,976 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 347 transitions, 741 flow [2025-01-09 21:29:53,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:53,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:53,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:53,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:29:53,977 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:53,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash 97469428, now seen corresponding path program 1 times [2025-01-09 21:29:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:53,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641334910] [2025-01-09 21:29:53,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:53,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:29:53,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:29:53,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:53,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:54,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641334910] [2025-01-09 21:29:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641334910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:54,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:54,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260309079] [2025-01-09 21:29:54,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:54,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:54,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:54,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:54,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:54,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-01-09 21:29:54,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 347 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:54,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:54,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-01-09 21:29:54,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:54,228 INFO L124 PetriNetUnfolderBase]: 199/1421 cut-off events. [2025-01-09 21:29:54,228 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-01-09 21:29:54,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 1421 events. 199/1421 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9644 event pairs, 98 based on Foata normal form. 0/1239 useless extension candidates. Maximal degree in co-relation 1436. Up to 302 conditions per place. [2025-01-09 21:29:54,245 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 0/351 dead transitions. [2025-01-09 21:29:54,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 351 transitions, 830 flow [2025-01-09 21:29:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2025-01-09 21:29:54,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9349397590361446 [2025-01-09 21:29:54,247 INFO L175 Difference]: Start difference. First operand has 344 places, 347 transitions, 741 flow. Second operand 3 states and 1164 transitions. [2025-01-09 21:29:54,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 351 transitions, 830 flow [2025-01-09 21:29:54,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 351 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:54,252 INFO L231 Difference]: Finished difference. Result has 340 places, 342 transitions, 739 flow [2025-01-09 21:29:54,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=340, PETRI_TRANSITIONS=342} [2025-01-09 21:29:54,254 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -39 predicate places. [2025-01-09 21:29:54,254 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 342 transitions, 739 flow [2025-01-09 21:29:54,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:54,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:54,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:54,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:29:54,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:54,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash -131661210, now seen corresponding path program 1 times [2025-01-09 21:29:54,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:54,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714741772] [2025-01-09 21:29:54,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:54,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:54,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 21:29:54,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 21:29:54,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:54,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:54,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:54,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714741772] [2025-01-09 21:29:54,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714741772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:54,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:54,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500749675] [2025-01-09 21:29:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:54,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:54,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:54,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:54,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:54,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-01-09 21:29:54,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 342 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:54,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:54,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-01-09 21:29:54,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:54,451 INFO L124 PetriNetUnfolderBase]: 175/1141 cut-off events. [2025-01-09 21:29:54,451 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-09 21:29:54,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 1141 events. 175/1141 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6503 event pairs, 82 based on Foata normal form. 1/1044 useless extension candidates. Maximal degree in co-relation 912. Up to 269 conditions per place. [2025-01-09 21:29:54,463 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 8/348 dead transitions. [2025-01-09 21:29:54,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 348 transitions, 836 flow [2025-01-09 21:29:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:29:54,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-01-09 21:29:54,465 INFO L175 Difference]: Start difference. First operand has 340 places, 342 transitions, 739 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:29:54,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 348 transitions, 836 flow [2025-01-09 21:29:54,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 348 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:54,470 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 721 flow [2025-01-09 21:29:54,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2025-01-09 21:29:54,471 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -43 predicate places. [2025-01-09 21:29:54,471 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 721 flow [2025-01-09 21:29:54,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:54,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:54,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:54,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:29:54,472 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:29:54,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1585636668, now seen corresponding path program 1 times [2025-01-09 21:29:54,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:54,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007405811] [2025-01-09 21:29:54,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:54,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:54,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:29:54,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:29:54,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:54,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:54,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007405811] [2025-01-09 21:29:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007405811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187965084] [2025-01-09 21:29:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:54,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:54,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:54,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:54,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 415 [2025-01-09 21:29:54,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:54,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:54,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 415 [2025-01-09 21:29:54,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,382 INFO L124 PetriNetUnfolderBase]: 17906/60994 cut-off events. [2025-01-09 21:30:00,383 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2025-01-09 21:30:00,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89458 conditions, 60994 events. 17906/60994 cut-off events. For 1608/1608 co-relation queries the response was YES. Maximal size of possible extension queue 2231. Compared 865554 event pairs, 8762 based on Foata normal form. 1/52708 useless extension candidates. Maximal degree in co-relation 34103. Up to 21614 conditions per place. [2025-01-09 21:30:00,992 INFO L140 encePairwiseOnDemand]: 397/415 looper letters, 29 selfloop transitions, 6 changer transitions 58/328 dead transitions. [2025-01-09 21:30:00,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 328 transitions, 818 flow [2025-01-09 21:30:00,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-01-09 21:30:00,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076305220883534 [2025-01-09 21:30:00,995 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 721 flow. Second operand 3 states and 1130 transitions. [2025-01-09 21:30:00,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 328 transitions, 818 flow [2025-01-09 21:30:01,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 328 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:01,108 INFO L231 Difference]: Finished difference. Result has 319 places, 265 transitions, 619 flow [2025-01-09 21:30:01,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=319, PETRI_TRANSITIONS=265} [2025-01-09 21:30:01,110 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -60 predicate places. [2025-01-09 21:30:01,111 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 265 transitions, 619 flow [2025-01-09 21:30:01,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:01,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:01,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:01,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:01,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:30:01,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1794437906, now seen corresponding path program 1 times [2025-01-09 21:30:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101629781] [2025-01-09 21:30:01,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:01,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:30:01,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:30:01,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:01,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:01,151 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:01,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:01,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101629781] [2025-01-09 21:30:01,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101629781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:01,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:01,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309458853] [2025-01-09 21:30:01,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:01,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:01,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:01,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:01,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:01,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-01-09 21:30:01,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 265 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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:01,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:01,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-01-09 21:30:01,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:01,922 INFO L124 PetriNetUnfolderBase]: 1604/7454 cut-off events. [2025-01-09 21:30:01,922 INFO L125 PetriNetUnfolderBase]: For 33/49 co-relation queries the response was YES. [2025-01-09 21:30:01,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10493 conditions, 7454 events. 1604/7454 cut-off events. For 33/49 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 81581 event pairs, 362 based on Foata normal form. 0/6282 useless extension candidates. Maximal degree in co-relation 5435. Up to 1748 conditions per place. [2025-01-09 21:30:01,986 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-01-09 21:30:01,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 269 transitions, 684 flow [2025-01-09 21:30:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-01-09 21:30:01,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-01-09 21:30:01,989 INFO L175 Difference]: Start difference. First operand has 319 places, 265 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2025-01-09 21:30:01,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 269 transitions, 684 flow [2025-01-09 21:30:01,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 269 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:01,996 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 621 flow [2025-01-09 21:30:01,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=268, PETRI_TRANSITIONS=264} [2025-01-09 21:30:01,997 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -111 predicate places. [2025-01-09 21:30:01,997 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 621 flow [2025-01-09 21:30:01,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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:01,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:01,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:01,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:01,998 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:30:01,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1233554861, now seen corresponding path program 1 times [2025-01-09 21:30:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:01,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287066896] [2025-01-09 21:30:01,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:02,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:30:02,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:30:02,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:02,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:02,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:02,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287066896] [2025-01-09 21:30:02,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287066896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:02,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:02,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883342667] [2025-01-09 21:30:02,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:02,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:02,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:02,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:02,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-01-09 21:30:02,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 264 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:02,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:02,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-01-09 21:30:02,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:03,437 INFO L124 PetriNetUnfolderBase]: 3288/13832 cut-off events. [2025-01-09 21:30:03,437 INFO L125 PetriNetUnfolderBase]: For 273/289 co-relation queries the response was YES. [2025-01-09 21:30:03,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20763 conditions, 13832 events. 3288/13832 cut-off events. For 273/289 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 168914 event pairs, 981 based on Foata normal form. 0/12203 useless extension candidates. Maximal degree in co-relation 20163. Up to 2895 conditions per place. [2025-01-09 21:30:03,578 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-01-09 21:30:03,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 268 transitions, 686 flow [2025-01-09 21:30:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-01-09 21:30:03,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-01-09 21:30:03,581 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 621 flow. Second operand 3 states and 1172 transitions. [2025-01-09 21:30:03,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 268 transitions, 686 flow [2025-01-09 21:30:03,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:03,587 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 619 flow [2025-01-09 21:30:03,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2025-01-09 21:30:03,587 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -112 predicate places. [2025-01-09 21:30:03,587 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 619 flow [2025-01-09 21:30:03,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:03,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:03,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:03,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:03,588 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:30:03,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1896144623, now seen corresponding path program 1 times [2025-01-09 21:30:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:03,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865478943] [2025-01-09 21:30:03,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:03,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:30:03,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:30:03,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:03,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:03,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:03,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865478943] [2025-01-09 21:30:03,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865478943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:03,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:03,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123315360] [2025-01-09 21:30:03,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:03,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:03,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:03,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:03,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-01-09 21:30:03,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:03,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:03,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-01-09 21:30:03,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:04,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 341#$Ultimate##0true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 244#L107-4true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 446#true]) [2025-01-09 21:30:04,113 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2025-01-09 21:30:04,113 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:30:04,113 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:30:04,113 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:30:04,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 341#$Ultimate##0true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 244#L107-4true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:04,114 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-01-09 21:30:04,114 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-01-09 21:30:04,114 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:30:04,114 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:04,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 244#L107-4true, Black: 438#true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true, 446#true]) [2025-01-09 21:30:04,291 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-01-09 21:30:04,291 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:30:04,292 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:04,292 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-01-09 21:30:04,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 244#L107-4true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:04,293 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-01-09 21:30:04,293 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-01-09 21:30:04,293 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-01-09 21:30:04,293 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-01-09 21:30:04,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 244#L107-4true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:04,334 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-01-09 21:30:04,334 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-01-09 21:30:04,334 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:30:04,334 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:04,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 465#true, 339#L41-3true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 244#L107-4true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:04,335 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-01-09 21:30:04,335 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-01-09 21:30:04,335 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:30:04,335 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-01-09 21:30:04,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:04,415 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-01-09 21:30:04,415 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:04,415 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-01-09 21:30:04,415 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:30:04,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 446#true]) [2025-01-09 21:30:04,416 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-01-09 21:30:04,416 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:30:04,416 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-01-09 21:30:04,416 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-01-09 21:30:04,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 377#L81-3true, 468#true, 340#L65-3true, Black: 442#true, 446#true]) [2025-01-09 21:30:04,416 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-01-09 21:30:04,416 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-01-09 21:30:04,416 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:04,416 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:30:04,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 244#L107-4true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true]) [2025-01-09 21:30:04,525 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-01-09 21:30:04,525 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-01-09 21:30:04,525 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:30:04,525 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-01-09 21:30:04,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 244#L107-4true, Black: 438#true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true]) [2025-01-09 21:30:04,527 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-01-09 21:30:04,527 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-01-09 21:30:04,527 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:04,527 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-01-09 21:30:04,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:04,582 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-01-09 21:30:04,582 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:30:04,582 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:30:04,582 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:04,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true, 446#true]) [2025-01-09 21:30:04,582 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-01-09 21:30:04,582 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:04,582 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:30:04,582 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-01-09 21:30:04,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 377#L81-3true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true, 446#true]) [2025-01-09 21:30:04,583 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-01-09 21:30:04,583 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:30:04,583 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:04,583 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:30:04,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 341#$Ultimate##0true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:04,620 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-01-09 21:30:04,620 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-01-09 21:30:04,620 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-01-09 21:30:04,620 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:04,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:04,620 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-01-09 21:30:04,620 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:30:04,620 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:30:04,620 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:04,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:04,621 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-01-09 21:30:04,621 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:04,621 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-01-09 21:30:04,621 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-01-09 21:30:04,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 341#$Ultimate##0true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 377#L81-3true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:04,709 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-01-09 21:30:04,709 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:04,709 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:30:04,709 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:30:04,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, 312#$Ultimate##0true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:04,764 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-01-09 21:30:04,764 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:04,764 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-01-09 21:30:04,764 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-01-09 21:30:04,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:04,764 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-01-09 21:30:04,764 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:30:04,764 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:04,764 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:30:04,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 377#L81-3true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true]) [2025-01-09 21:30:04,765 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-01-09 21:30:04,765 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:30:04,765 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:04,765 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:30:04,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:04,829 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-01-09 21:30:04,829 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-01-09 21:30:04,829 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:04,829 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-01-09 21:30:04,959 INFO L124 PetriNetUnfolderBase]: 2474/10213 cut-off events. [2025-01-09 21:30:04,959 INFO L125 PetriNetUnfolderBase]: For 441/457 co-relation queries the response was YES. [2025-01-09 21:30:05,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15307 conditions, 10213 events. 2474/10213 cut-off events. For 441/457 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 117851 event pairs, 718 based on Foata normal form. 0/8892 useless extension candidates. Maximal degree in co-relation 14215. Up to 2243 conditions per place. [2025-01-09 21:30:05,111 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-01-09 21:30:05,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 267 transitions, 684 flow [2025-01-09 21:30:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-01-09 21:30:05,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-01-09 21:30:05,114 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2025-01-09 21:30:05,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 267 transitions, 684 flow [2025-01-09 21:30:05,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:05,123 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 617 flow [2025-01-09 21:30:05,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2025-01-09 21:30:05,124 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -113 predicate places. [2025-01-09 21:30:05,124 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 617 flow [2025-01-09 21:30:05,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:05,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:05,125 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:05,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:05,126 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:30:05,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash 635437828, now seen corresponding path program 1 times [2025-01-09 21:30:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:05,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067417015] [2025-01-09 21:30:05,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:05,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:05,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:05,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:05,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:05,172 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:05,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:05,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067417015] [2025-01-09 21:30:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067417015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:05,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83107488] [2025-01-09 21:30:05,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:05,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:05,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:05,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:05,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-01-09 21:30:05,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:05,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:05,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-01-09 21:30:05,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:05,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, 190#$Ultimate##0true, 312#$Ultimate##0true, 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:05,927 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-01-09 21:30:05,927 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-01-09 21:30:05,927 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-01-09 21:30:05,927 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:30:05,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 190#$Ultimate##0true, 41#L73-3true, Black: 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:05,928 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-01-09 21:30:05,928 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:05,928 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:30:05,928 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-01-09 21:30:06,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, 339#L41-3true, 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:06,083 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-01-09 21:30:06,083 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:06,083 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:30:06,083 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-01-09 21:30:06,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 339#L41-3true, Black: 458#true, 273#L108-4true, 341#$Ultimate##0true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:06,083 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-01-09 21:30:06,083 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:30:06,084 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:30:06,084 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:06,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, 190#$Ultimate##0true, 312#$Ultimate##0true, 454#true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:06,086 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-01-09 21:30:06,086 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:06,086 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:30:06,086 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-01-09 21:30:06,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 190#$Ultimate##0true, 41#L73-3true, Black: 454#true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:06,087 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-01-09 21:30:06,087 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:06,087 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:30:06,087 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:30:06,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 190#$Ultimate##0true, 41#L73-3true, 312#$Ultimate##0true, Black: 454#true, 273#L108-4true, Black: 458#true, 341#$Ultimate##0true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:06,138 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-01-09 21:30:06,138 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-01-09 21:30:06,138 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-01-09 21:30:06,138 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-01-09 21:30:06,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, 339#L41-3true, 454#true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true]) [2025-01-09 21:30:06,226 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-01-09 21:30:06,226 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:06,227 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-01-09 21:30:06,227 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-01-09 21:30:06,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 339#L41-3true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:06,227 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-01-09 21:30:06,227 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:30:06,227 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-01-09 21:30:06,227 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-01-09 21:30:06,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 312#$Ultimate##0true, 339#L41-3true, Black: 458#true, 341#$Ultimate##0true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2025-01-09 21:30:06,264 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-01-09 21:30:06,264 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:06,264 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-01-09 21:30:06,264 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-01-09 21:30:06,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 190#$Ultimate##0true, 41#L73-3true, Black: 454#true, 312#$Ultimate##0true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:06,265 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-01-09 21:30:06,265 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-01-09 21:30:06,265 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-01-09 21:30:06,266 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-01-09 21:30:06,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 312#$Ultimate##0true, 339#L41-3true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2025-01-09 21:30:06,356 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-01-09 21:30:06,356 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-01-09 21:30:06,356 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-01-09 21:30:06,356 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-01-09 21:30:06,449 INFO L124 PetriNetUnfolderBase]: 2368/9261 cut-off events. [2025-01-09 21:30:06,449 INFO L125 PetriNetUnfolderBase]: For 491/513 co-relation queries the response was YES. [2025-01-09 21:30:06,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14203 conditions, 9261 events. 2368/9261 cut-off events. For 491/513 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 104231 event pairs, 725 based on Foata normal form. 2/8149 useless extension candidates. Maximal degree in co-relation 13541. Up to 2033 conditions per place. [2025-01-09 21:30:06,592 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-01-09 21:30:06,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 266 transitions, 682 flow [2025-01-09 21:30:06,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-01-09 21:30:06,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-01-09 21:30:06,595 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 617 flow. Second operand 3 states and 1172 transitions. [2025-01-09 21:30:06,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 266 transitions, 682 flow [2025-01-09 21:30:06,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:06,601 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 615 flow [2025-01-09 21:30:06,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2025-01-09 21:30:06,602 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -114 predicate places. [2025-01-09 21:30:06,602 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 615 flow [2025-01-09 21:30:06,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:06,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:06,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:06,603 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:30:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1850627078, now seen corresponding path program 1 times [2025-01-09 21:30:06,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:06,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865773092] [2025-01-09 21:30:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:06,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:30:06,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:30:06,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:06,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:06,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865773092] [2025-01-09 21:30:06,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865773092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:06,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161239160] [2025-01-09 21:30:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:06,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:06,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:06,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:06,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-01-09 21:30:06,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:06,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-01-09 21:30:06,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,699 INFO L124 PetriNetUnfolderBase]: 1913/7673 cut-off events. [2025-01-09 21:30:07,699 INFO L125 PetriNetUnfolderBase]: For 430/473 co-relation queries the response was YES. [2025-01-09 21:30:07,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11697 conditions, 7673 events. 1913/7673 cut-off events. For 430/473 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 82636 event pairs, 588 based on Foata normal form. 5/6791 useless extension candidates. Maximal degree in co-relation 10772. Up to 1778 conditions per place. [2025-01-09 21:30:07,776 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-01-09 21:30:07,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 680 flow [2025-01-09 21:30:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-01-09 21:30:07,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-01-09 21:30:07,778 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 615 flow. Second operand 3 states and 1172 transitions. [2025-01-09 21:30:07,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 680 flow [2025-01-09 21:30:07,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:07,785 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 613 flow [2025-01-09 21:30:07,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2025-01-09 21:30:07,786 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -115 predicate places. [2025-01-09 21:30:07,786 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 613 flow [2025-01-09 21:30:07,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:07,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:07,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:07,787 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-01-09 21:30:07,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash 697579009, now seen corresponding path program 1 times [2025-01-09 21:30:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:07,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824646886] [2025-01-09 21:30:07,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:07,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:30:07,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:30:07,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:07,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824646886] [2025-01-09 21:30:07,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824646886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:07,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:07,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591131017] [2025-01-09 21:30:07,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:07,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:07,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:07,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:07,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-01-09 21:30:07,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:07,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-01-09 21:30:07,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:08,354 INFO L124 PetriNetUnfolderBase]: 1313/5788 cut-off events. [2025-01-09 21:30:08,354 INFO L125 PetriNetUnfolderBase]: For 224/252 co-relation queries the response was YES. [2025-01-09 21:30:08,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8383 conditions, 5788 events. 1313/5788 cut-off events. For 224/252 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 58401 event pairs, 333 based on Foata normal form. 4/5099 useless extension candidates. Maximal degree in co-relation 7691. Up to 1400 conditions per place. [2025-01-09 21:30:08,405 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 0 selfloop transitions, 0 changer transitions 264/264 dead transitions. [2025-01-09 21:30:08,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 678 flow [2025-01-09 21:30:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-01-09 21:30:08,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-01-09 21:30:08,406 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 613 flow. Second operand 3 states and 1172 transitions. [2025-01-09 21:30:08,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 678 flow [2025-01-09 21:30:08,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:08,411 INFO L231 Difference]: Finished difference. Result has 263 places, 0 transitions, 0 flow [2025-01-09 21:30:08,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=263, PETRI_TRANSITIONS=0} [2025-01-09 21:30:08,411 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -116 predicate places. [2025-01-09 21:30:08,411 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 0 transitions, 0 flow [2025-01-09 21:30:08,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:08,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (96 of 97 remaining) [2025-01-09 21:30:08,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (95 of 97 remaining) [2025-01-09 21:30:08,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (94 of 97 remaining) [2025-01-09 21:30:08,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (93 of 97 remaining) [2025-01-09 21:30:08,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (92 of 97 remaining) [2025-01-09 21:30:08,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (91 of 97 remaining) [2025-01-09 21:30:08,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (90 of 97 remaining) [2025-01-09 21:30:08,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (89 of 97 remaining) [2025-01-09 21:30:08,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (88 of 97 remaining) [2025-01-09 21:30:08,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (87 of 97 remaining) [2025-01-09 21:30:08,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (85 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (84 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (83 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (82 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (81 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (80 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (79 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (78 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (77 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (76 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (75 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (74 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (73 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (72 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (71 of 97 remaining) [2025-01-09 21:30:08,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (70 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (69 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (68 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (67 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (65 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (64 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (63 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (62 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (61 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (60 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (59 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (58 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (57 of 97 remaining) [2025-01-09 21:30:08,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (56 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (55 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (54 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (53 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (52 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (51 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 97 remaining) [2025-01-09 21:30:08,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 97 remaining) [2025-01-09 21:30:08,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 97 remaining) [2025-01-09 21:30:08,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 97 remaining) [2025-01-09 21:30:08,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 97 remaining) [2025-01-09 21:30:08,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 97 remaining) [2025-01-09 21:30:08,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 97 remaining) [2025-01-09 21:30:08,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 97 remaining) [2025-01-09 21:30:08,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 97 remaining) [2025-01-09 21:30:08,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 97 remaining) [2025-01-09 21:30:08,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 97 remaining) [2025-01-09 21:30:08,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 97 remaining) [2025-01-09 21:30:08,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 97 remaining) [2025-01-09 21:30:08,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:08,423 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:08,426 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:08,427 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:08,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:08 BasicIcfg [2025-01-09 21:30:08,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:08,435 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:08,435 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:08,435 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:08,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:50" (3/4) ... [2025-01-09 21:30:08,436 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:08,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:08,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:08,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:30:08,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:30:08,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-01-09 21:30:08,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-01-09 21:30:08,444 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-09 21:30:08,445 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 21:30:08,445 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:30:08,445 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:08,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:08,519 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:08,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:08,520 INFO L158 Benchmark]: Toolchain (without parser) took 18366.07ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 115.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-01-09 21:30:08,520 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:08,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.81ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 102.2MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:08,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.48ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:08,522 INFO L158 Benchmark]: Boogie Preprocessor took 19.06ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:08,523 INFO L158 Benchmark]: RCFGBuilder took 531.80ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 71.9MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:30:08,523 INFO L158 Benchmark]: TraceAbstraction took 17482.40ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 71.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-01-09 21:30:08,523 INFO L158 Benchmark]: Witness Printer took 84.18ms. Allocated memory is still 3.6GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:08,524 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.15ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.81ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 102.2MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.48ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.06ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 531.80ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 71.9MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17482.40ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 71.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 84.18ms. Allocated memory is still 3.6GB. Free memory was 2.2GB in the beginning and 2.2GB 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: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - 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: 50]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: 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: 94]: 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: 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: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 536 locations, 97 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: 17.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 209 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=0, InterpolantAutomatonStates: 60, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1604 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 61 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:08,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE