./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.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/popl20-bad-commit-2.wvr-bad.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 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:37,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:37,996 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:32:38,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:38,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:38,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:38,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:38,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:38,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:38,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:38,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:38,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:38,020 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:38,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:38,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:38,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:38,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:38,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:38,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:38,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:38,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:38,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:38,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:38,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:38,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:38,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:38,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:38,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:38,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:38,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:38,023 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 -> 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 [2025-01-09 21:32:38,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:38,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:38,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:38,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:38,314 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:38,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-01-09 21:32:39,486 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a60431c7/12480f5981174cd5ab3f59da2b0d99d3/FLAG0b11bebf4 [2025-01-09 21:32:39,761 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:39,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-01-09 21:32:39,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a60431c7/12480f5981174cd5ab3f59da2b0d99d3/FLAG0b11bebf4 [2025-01-09 21:32:40,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a60431c7/12480f5981174cd5ab3f59da2b0d99d3 [2025-01-09 21:32:40,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:40,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:40,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:40,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:40,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:40,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f99ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40, skipping insertion in model container [2025-01-09 21:32:40,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:40,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:40,278 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:40,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:40,341 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:40,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40 WrapperNode [2025-01-09 21:32:40,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:40,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:40,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:40,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:40,349 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:32:40" (1/1) ... [2025-01-09 21:32:40,358 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:32:40" (1/1) ... [2025-01-09 21:32:40,404 INFO L138 Inliner]: procedures = 25, calls = 74, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 1037 [2025-01-09 21:32:40,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:40,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:40,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:40,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:40,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:40,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:40,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:40,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:40,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (1/1) ... [2025-01-09 21:32:40,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:40,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:40,542 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:32:40,552 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:32:40,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:40,565 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:40,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:40,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:40,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:32:40,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:32:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:32:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:32:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:32:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:32:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:40,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:32:40,568 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:32:40,683 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:40,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:41,578 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:41,578 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:42,344 WARN L170 LargeBlockEncoding]: Complex 2:8 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-01-09 21:32:42,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:42,357 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:32:42,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:42 BoogieIcfgContainer [2025-01-09 21:32:42,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:42,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:42,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:42,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:42,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:40" (1/3) ... [2025-01-09 21:32:42,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1ef66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:42, skipping insertion in model container [2025-01-09 21:32:42,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:40" (2/3) ... [2025-01-09 21:32:42,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1ef66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:42, skipping insertion in model container [2025-01-09 21:32:42,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:42" (3/3) ... [2025-01-09 21:32:42,367 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2025-01-09 21:32:42,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:42,381 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-2.wvr-bad.c that has 5 procedures, 656 locations, 1 initial locations, 8 loop locations, and 182 error locations. [2025-01-09 21:32:42,381 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:42,560 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:32:42,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 668 places, 696 transitions, 1420 flow [2025-01-09 21:32:42,869 INFO L124 PetriNetUnfolderBase]: 41/692 cut-off events. [2025-01-09 21:32:42,872 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:42,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 692 events. 41/692 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1590 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 628. Up to 8 conditions per place. [2025-01-09 21:32:42,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 668 places, 696 transitions, 1420 flow [2025-01-09 21:32:42,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 648 places, 675 transitions, 1374 flow [2025-01-09 21:32:42,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:42,922 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;@2e173c11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:42,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 336 error locations. [2025-01-09 21:32:42,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:42,932 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2025-01-09 21:32:42,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:42,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:42,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:42,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash 778842702, now seen corresponding path program 1 times [2025-01-09 21:32:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:42,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10736593] [2025-01-09 21:32:42,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:42,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:43,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:32:43,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:32:43,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:43,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:43,075 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:32:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10736593] [2025-01-09 21:32:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10736593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:43,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:43,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092994412] [2025-01-09 21:32:43,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:43,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:43,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:43,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:43,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:43,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 696 [2025-01-09 21:32:43,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 675 transitions, 1374 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:43,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 696 [2025-01-09 21:32:43,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:43,264 INFO L124 PetriNetUnfolderBase]: 56/552 cut-off events. [2025-01-09 21:32:43,265 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:43,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 552 events. 56/552 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 578 event pairs, 0 based on Foata normal form. 24/489 useless extension candidates. Maximal degree in co-relation 539. Up to 61 conditions per place. [2025-01-09 21:32:43,269 INFO L140 encePairwiseOnDemand]: 535/696 looper letters, 24 selfloop transitions, 2 changer transitions 8/516 dead transitions. [2025-01-09 21:32:43,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 516 transitions, 1108 flow [2025-01-09 21:32:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-01-09 21:32:43,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8184865900383141 [2025-01-09 21:32:43,282 INFO L175 Difference]: Start difference. First operand has 648 places, 675 transitions, 1374 flow. Second operand 3 states and 1709 transitions. [2025-01-09 21:32:43,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 516 transitions, 1108 flow [2025-01-09 21:32:43,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 516 transitions, 1092 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:32:43,293 INFO L231 Difference]: Finished difference. Result has 503 places, 508 transitions, 1028 flow [2025-01-09 21:32:43,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=503, PETRI_TRANSITIONS=508} [2025-01-09 21:32:43,297 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -145 predicate places. [2025-01-09 21:32:43,298 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 508 transitions, 1028 flow [2025-01-09 21:32:43,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:43,299 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] [2025-01-09 21:32:43,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:43,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:43,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2019468328, now seen corresponding path program 1 times [2025-01-09 21:32:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022313030] [2025-01-09 21:32:43,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:43,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:32:43,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:32:43,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:43,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:43,343 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:32:43,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:43,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022313030] [2025-01-09 21:32:43,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022313030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:43,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:43,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400418156] [2025-01-09 21:32:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:43,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:43,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:43,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:43,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:43,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 696 [2025-01-09 21:32:43,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 508 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:43,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 696 [2025-01-09 21:32:43,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:43,469 INFO L124 PetriNetUnfolderBase]: 56/543 cut-off events. [2025-01-09 21:32:43,469 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:32:43,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 543 events. 56/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 565 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 568. Up to 61 conditions per place. [2025-01-09 21:32:43,472 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 24 selfloop transitions, 2 changer transitions 0/507 dead transitions. [2025-01-09 21:32:43,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 507 transitions, 1078 flow [2025-01-09 21:32:43,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-01-09 21:32:43,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.742816091954023 [2025-01-09 21:32:43,477 INFO L175 Difference]: Start difference. First operand has 503 places, 508 transitions, 1028 flow. Second operand 3 states and 1551 transitions. [2025-01-09 21:32:43,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 507 transitions, 1078 flow [2025-01-09 21:32:43,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 507 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:43,486 INFO L231 Difference]: Finished difference. Result has 494 places, 507 transitions, 1026 flow [2025-01-09 21:32:43,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=494, PETRI_TRANSITIONS=507} [2025-01-09 21:32:43,488 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -154 predicate places. [2025-01-09 21:32:43,488 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 507 transitions, 1026 flow [2025-01-09 21:32:43,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:43,490 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:32:43,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:43,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:43,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1822144591, now seen corresponding path program 1 times [2025-01-09 21:32:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:43,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833707924] [2025-01-09 21:32:43,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:43,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:32:43,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:32:43,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:43,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:43,569 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:32:43,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:43,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833707924] [2025-01-09 21:32:43,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833707924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:43,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:43,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:43,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846908359] [2025-01-09 21:32:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:43,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:43,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:43,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:43,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:43,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 696 [2025-01-09 21:32:43,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 507 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:43,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 696 [2025-01-09 21:32:43,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:43,749 INFO L124 PetriNetUnfolderBase]: 56/542 cut-off events. [2025-01-09 21:32:43,749 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:32:43,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 542 events. 56/542 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 567 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 559. Up to 61 conditions per place. [2025-01-09 21:32:43,755 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 24 selfloop transitions, 2 changer transitions 0/506 dead transitions. [2025-01-09 21:32:43,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 506 transitions, 1076 flow [2025-01-09 21:32:43,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-01-09 21:32:43,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.742816091954023 [2025-01-09 21:32:43,761 INFO L175 Difference]: Start difference. First operand has 494 places, 507 transitions, 1026 flow. Second operand 3 states and 1551 transitions. [2025-01-09 21:32:43,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 506 transitions, 1076 flow [2025-01-09 21:32:43,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 506 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:43,767 INFO L231 Difference]: Finished difference. Result has 493 places, 506 transitions, 1024 flow [2025-01-09 21:32:43,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=493, PETRI_TRANSITIONS=506} [2025-01-09 21:32:43,769 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -155 predicate places. [2025-01-09 21:32:43,769 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 506 transitions, 1024 flow [2025-01-09 21:32:43,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:43,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:43,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:43,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:43,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash 967564367, now seen corresponding path program 1 times [2025-01-09 21:32:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:43,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481851049] [2025-01-09 21:32:43,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:43,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:32:43,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:32:43,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:43,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:43,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481851049] [2025-01-09 21:32:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481851049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:43,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095314080] [2025-01-09 21:32:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:43,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:43,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:43,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 696 [2025-01-09 21:32:43,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 506 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:43,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:43,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 696 [2025-01-09 21:32:43,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:44,039 INFO L124 PetriNetUnfolderBase]: 107/750 cut-off events. [2025-01-09 21:32:44,039 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:32:44,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 750 events. 107/750 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1584 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 814. Up to 69 conditions per place. [2025-01-09 21:32:44,046 INFO L140 encePairwiseOnDemand]: 691/696 looper letters, 38 selfloop transitions, 4 changer transitions 0/524 dead transitions. [2025-01-09 21:32:44,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 524 transitions, 1151 flow [2025-01-09 21:32:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1579 transitions. [2025-01-09 21:32:44,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7562260536398467 [2025-01-09 21:32:44,050 INFO L175 Difference]: Start difference. First operand has 493 places, 506 transitions, 1024 flow. Second operand 3 states and 1579 transitions. [2025-01-09 21:32:44,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 524 transitions, 1151 flow [2025-01-09 21:32:44,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 524 transitions, 1147 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:44,058 INFO L231 Difference]: Finished difference. Result has 493 places, 508 transitions, 1042 flow [2025-01-09 21:32:44,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=493, PETRI_TRANSITIONS=508} [2025-01-09 21:32:44,060 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -155 predicate places. [2025-01-09 21:32:44,061 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 508 transitions, 1042 flow [2025-01-09 21:32:44,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:44,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:44,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:44,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:44,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:44,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1823947398, now seen corresponding path program 1 times [2025-01-09 21:32:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517369818] [2025-01-09 21:32:44,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:44,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:32:44,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:32:44,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:44,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:44,098 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:32:44,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517369818] [2025-01-09 21:32:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517369818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:44,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:44,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106101798] [2025-01-09 21:32:44,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:44,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:44,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:44,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:44,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:44,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:44,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 508 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:44,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:44,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:44,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:44,236 INFO L124 PetriNetUnfolderBase]: 107/701 cut-off events. [2025-01-09 21:32:44,236 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-09 21:32:44,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 701 events. 107/701 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1385 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 523. Up to 115 conditions per place. [2025-01-09 21:32:44,241 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 26 selfloop transitions, 2 changer transitions 0/507 dead transitions. [2025-01-09 21:32:44,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 507 transitions, 1096 flow [2025-01-09 21:32:44,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:44,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:44,244 INFO L175 Difference]: Start difference. First operand has 493 places, 508 transitions, 1042 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:44,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 507 transitions, 1096 flow [2025-01-09 21:32:44,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 507 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:44,250 INFO L231 Difference]: Finished difference. Result has 493 places, 507 transitions, 1040 flow [2025-01-09 21:32:44,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=493, PETRI_TRANSITIONS=507} [2025-01-09 21:32:44,251 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -155 predicate places. [2025-01-09 21:32:44,251 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 507 transitions, 1040 flow [2025-01-09 21:32:44,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:44,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:44,252 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] [2025-01-09 21:32:44,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:44,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1582348370, now seen corresponding path program 1 times [2025-01-09 21:32:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442864932] [2025-01-09 21:32:44,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:32:44,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:32:44,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:44,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:44,285 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:32:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442864932] [2025-01-09 21:32:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442864932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147229508] [2025-01-09 21:32:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:44,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:44,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:44,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:44,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 696 [2025-01-09 21:32:44,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 507 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:44,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:44,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 696 [2025-01-09 21:32:44,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:44,406 INFO L124 PetriNetUnfolderBase]: 107/700 cut-off events. [2025-01-09 21:32:44,406 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:32:44,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 700 events. 107/700 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1366 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 781. Up to 113 conditions per place. [2025-01-09 21:32:44,412 INFO L140 encePairwiseOnDemand]: 694/696 looper letters, 25 selfloop transitions, 1 changer transitions 0/506 dead transitions. [2025-01-09 21:32:44,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 506 transitions, 1090 flow [2025-01-09 21:32:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-01-09 21:32:44,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2025-01-09 21:32:44,416 INFO L175 Difference]: Start difference. First operand has 493 places, 507 transitions, 1040 flow. Second operand 3 states and 1560 transitions. [2025-01-09 21:32:44,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 506 transitions, 1090 flow [2025-01-09 21:32:44,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 506 transitions, 1086 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:44,422 INFO L231 Difference]: Finished difference. Result has 492 places, 506 transitions, 1036 flow [2025-01-09 21:32:44,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=492, PETRI_TRANSITIONS=506} [2025-01-09 21:32:44,423 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -156 predicate places. [2025-01-09 21:32:44,424 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 506 transitions, 1036 flow [2025-01-09 21:32:44,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:44,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:44,425 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:32:44,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:44,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1818190414, now seen corresponding path program 1 times [2025-01-09 21:32:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800989406] [2025-01-09 21:32:44,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:44,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:32:44,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:32:44,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:44,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:44,478 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:32:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:44,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800989406] [2025-01-09 21:32:44,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800989406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:44,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:44,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:44,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679455871] [2025-01-09 21:32:44,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:44,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:44,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:44,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:44,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:44,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 506 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:44,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:44,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:44,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:44,599 INFO L124 PetriNetUnfolderBase]: 107/699 cut-off events. [2025-01-09 21:32:44,599 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:32:44,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 699 events. 107/699 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1386 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 781. Up to 115 conditions per place. [2025-01-09 21:32:44,604 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 26 selfloop transitions, 2 changer transitions 0/505 dead transitions. [2025-01-09 21:32:44,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 505 transitions, 1090 flow [2025-01-09 21:32:44,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:44,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:44,607 INFO L175 Difference]: Start difference. First operand has 492 places, 506 transitions, 1036 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:44,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 505 transitions, 1090 flow [2025-01-09 21:32:44,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 505 transitions, 1089 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:44,628 INFO L231 Difference]: Finished difference. Result has 492 places, 505 transitions, 1037 flow [2025-01-09 21:32:44,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1037, PETRI_PLACES=492, PETRI_TRANSITIONS=505} [2025-01-09 21:32:44,629 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -156 predicate places. [2025-01-09 21:32:44,629 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 505 transitions, 1037 flow [2025-01-09 21:32:44,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:44,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:44,630 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:32:44,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:44,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:44,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:44,631 INFO L85 PathProgramCache]: Analyzing trace with hash -433582092, now seen corresponding path program 1 times [2025-01-09 21:32:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:44,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833501519] [2025-01-09 21:32:44,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:44,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:32:44,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:32:44,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:44,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:45,186 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:32:45,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:45,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833501519] [2025-01-09 21:32:45,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833501519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:45,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:45,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:45,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723508167] [2025-01-09 21:32:45,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:45,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:45,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:45,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:45,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:45,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 696 [2025-01-09 21:32:45,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 505 transitions, 1037 flow. Second operand has 6 states, 6 states have (on average 461.5) internal successors, (2769), 6 states have internal predecessors, (2769), 0 states have call successors, (0), 0 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:32:45,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:45,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 696 [2025-01-09 21:32:45,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:45,851 INFO L124 PetriNetUnfolderBase]: 107/695 cut-off events. [2025-01-09 21:32:45,851 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:32:45,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 695 events. 107/695 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1343 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 827. Up to 144 conditions per place. [2025-01-09 21:32:45,856 INFO L140 encePairwiseOnDemand]: 672/696 looper letters, 55 selfloop transitions, 20 changer transitions 0/501 dead transitions. [2025-01-09 21:32:45,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 501 transitions, 1179 flow [2025-01-09 21:32:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:32:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:32:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2836 transitions. [2025-01-09 21:32:45,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6791187739463601 [2025-01-09 21:32:45,864 INFO L175 Difference]: Start difference. First operand has 492 places, 505 transitions, 1037 flow. Second operand 6 states and 2836 transitions. [2025-01-09 21:32:45,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 501 transitions, 1179 flow [2025-01-09 21:32:45,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 501 transitions, 1175 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:45,871 INFO L231 Difference]: Finished difference. Result has 491 places, 501 transitions, 1065 flow [2025-01-09 21:32:45,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1065, PETRI_PLACES=491, PETRI_TRANSITIONS=501} [2025-01-09 21:32:45,874 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -157 predicate places. [2025-01-09 21:32:45,874 INFO L471 AbstractCegarLoop]: Abstraction has has 491 places, 501 transitions, 1065 flow [2025-01-09 21:32:45,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 461.5) internal successors, (2769), 6 states have internal predecessors, (2769), 0 states have call successors, (0), 0 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:32:45,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:45,876 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] [2025-01-09 21:32:45,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:45,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1967273421, now seen corresponding path program 1 times [2025-01-09 21:32:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211718107] [2025-01-09 21:32:45,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:45,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:32:45,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:32:45,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:45,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:45,913 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:32:45,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:45,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211718107] [2025-01-09 21:32:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211718107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:45,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538185877] [2025-01-09 21:32:45,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:45,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:45,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:45,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:45,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:45,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 696 [2025-01-09 21:32:45,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 501 transitions, 1065 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:45,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:45,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 696 [2025-01-09 21:32:45,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,047 INFO L124 PetriNetUnfolderBase]: 107/694 cut-off events. [2025-01-09 21:32:46,047 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:32:46,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 694 events. 107/694 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1350 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 804. Up to 116 conditions per place. [2025-01-09 21:32:46,051 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 27 selfloop transitions, 2 changer transitions 0/500 dead transitions. [2025-01-09 21:32:46,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 500 transitions, 1121 flow [2025-01-09 21:32:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-01-09 21:32:46,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.742816091954023 [2025-01-09 21:32:46,054 INFO L175 Difference]: Start difference. First operand has 491 places, 501 transitions, 1065 flow. Second operand 3 states and 1551 transitions. [2025-01-09 21:32:46,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 500 transitions, 1121 flow [2025-01-09 21:32:46,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 500 transitions, 1081 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:46,061 INFO L231 Difference]: Finished difference. Result has 487 places, 500 transitions, 1027 flow [2025-01-09 21:32:46,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1027, PETRI_PLACES=487, PETRI_TRANSITIONS=500} [2025-01-09 21:32:46,062 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -161 predicate places. [2025-01-09 21:32:46,063 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 500 transitions, 1027 flow [2025-01-09 21:32:46,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:46,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:46,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:46,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,065 INFO L85 PathProgramCache]: Analyzing trace with hash 24086941, now seen corresponding path program 1 times [2025-01-09 21:32:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083442636] [2025-01-09 21:32:46,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:32:46,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:32:46,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,102 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:32:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083442636] [2025-01-09 21:32:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083442636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087765495] [2025-01-09 21:32:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 696 [2025-01-09 21:32:46,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 500 transitions, 1027 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:46,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 696 [2025-01-09 21:32:46,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,265 INFO L124 PetriNetUnfolderBase]: 161/897 cut-off events. [2025-01-09 21:32:46,265 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:32:46,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 897 events. 161/897 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2190 event pairs, 3 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 1042. Up to 105 conditions per place. [2025-01-09 21:32:46,275 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 43 selfloop transitions, 2 changer transitions 0/518 dead transitions. [2025-01-09 21:32:46,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 518 transitions, 1169 flow [2025-01-09 21:32:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1576 transitions. [2025-01-09 21:32:46,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7547892720306514 [2025-01-09 21:32:46,279 INFO L175 Difference]: Start difference. First operand has 487 places, 500 transitions, 1027 flow. Second operand 3 states and 1576 transitions. [2025-01-09 21:32:46,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 518 transitions, 1169 flow [2025-01-09 21:32:46,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 518 transitions, 1165 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:46,285 INFO L231 Difference]: Finished difference. Result has 487 places, 500 transitions, 1031 flow [2025-01-09 21:32:46,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=487, PETRI_TRANSITIONS=500} [2025-01-09 21:32:46,286 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -161 predicate places. [2025-01-09 21:32:46,287 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 500 transitions, 1031 flow [2025-01-09 21:32:46,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:46,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,288 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] [2025-01-09 21:32:46,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:46,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:46,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1277299846, now seen corresponding path program 1 times [2025-01-09 21:32:46,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834593559] [2025-01-09 21:32:46,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:32:46,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:32:46,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834593559] [2025-01-09 21:32:46,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834593559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448706518] [2025-01-09 21:32:46,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:46,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 500 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:46,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,451 INFO L124 PetriNetUnfolderBase]: 155/788 cut-off events. [2025-01-09 21:32:46,452 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:32:46,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 788 events. 155/788 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1707 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 957. Up to 171 conditions per place. [2025-01-09 21:32:46,457 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 27 selfloop transitions, 2 changer transitions 0/499 dead transitions. [2025-01-09 21:32:46,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 499 transitions, 1087 flow [2025-01-09 21:32:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:46,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:46,460 INFO L175 Difference]: Start difference. First operand has 487 places, 500 transitions, 1031 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:46,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 499 transitions, 1087 flow [2025-01-09 21:32:46,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 499 transitions, 1085 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:46,466 INFO L231 Difference]: Finished difference. Result has 487 places, 499 transitions, 1031 flow [2025-01-09 21:32:46,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=487, PETRI_TRANSITIONS=499} [2025-01-09 21:32:46,467 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -161 predicate places. [2025-01-09 21:32:46,467 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 499 transitions, 1031 flow [2025-01-09 21:32:46,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,468 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] [2025-01-09 21:32:46,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:46,468 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:46,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,469 INFO L85 PathProgramCache]: Analyzing trace with hash 205038135, now seen corresponding path program 1 times [2025-01-09 21:32:46,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82985273] [2025-01-09 21:32:46,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 21:32:46,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 21:32:46,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:46,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82985273] [2025-01-09 21:32:46,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82985273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890024531] [2025-01-09 21:32:46,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 696 [2025-01-09 21:32:46,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 499 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 696 [2025-01-09 21:32:46,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,643 INFO L124 PetriNetUnfolderBase]: 155/787 cut-off events. [2025-01-09 21:32:46,644 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 21:32:46,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 787 events. 155/787 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1709 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 951. Up to 172 conditions per place. [2025-01-09 21:32:46,649 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 28 selfloop transitions, 2 changer transitions 0/498 dead transitions. [2025-01-09 21:32:46,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 498 transitions, 1089 flow [2025-01-09 21:32:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-01-09 21:32:46,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.742816091954023 [2025-01-09 21:32:46,652 INFO L175 Difference]: Start difference. First operand has 487 places, 499 transitions, 1031 flow. Second operand 3 states and 1551 transitions. [2025-01-09 21:32:46,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 498 transitions, 1089 flow [2025-01-09 21:32:46,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 498 transitions, 1085 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:46,657 INFO L231 Difference]: Finished difference. Result has 486 places, 498 transitions, 1029 flow [2025-01-09 21:32:46,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=486, PETRI_TRANSITIONS=498} [2025-01-09 21:32:46,658 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -162 predicate places. [2025-01-09 21:32:46,659 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 498 transitions, 1029 flow [2025-01-09 21:32:46,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,660 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:32:46,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:46,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:46,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash 626142085, now seen corresponding path program 1 times [2025-01-09 21:32:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328537287] [2025-01-09 21:32:46,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:32:46,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:32:46,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,687 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:32:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328537287] [2025-01-09 21:32:46,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328537287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226795283] [2025-01-09 21:32:46,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 696 [2025-01-09 21:32:46,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 498 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:46,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 696 [2025-01-09 21:32:46,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,803 INFO L124 PetriNetUnfolderBase]: 155/786 cut-off events. [2025-01-09 21:32:46,803 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:32:46,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 786 events. 155/786 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1709 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 948. Up to 169 conditions per place. [2025-01-09 21:32:46,808 INFO L140 encePairwiseOnDemand]: 694/696 looper letters, 26 selfloop transitions, 1 changer transitions 0/497 dead transitions. [2025-01-09 21:32:46,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 497 transitions, 1081 flow [2025-01-09 21:32:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-01-09 21:32:46,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2025-01-09 21:32:46,811 INFO L175 Difference]: Start difference. First operand has 486 places, 498 transitions, 1029 flow. Second operand 3 states and 1560 transitions. [2025-01-09 21:32:46,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 497 transitions, 1081 flow [2025-01-09 21:32:46,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 497 transitions, 1077 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:46,817 INFO L231 Difference]: Finished difference. Result has 485 places, 497 transitions, 1025 flow [2025-01-09 21:32:46,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=485, PETRI_TRANSITIONS=497} [2025-01-09 21:32:46,818 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -163 predicate places. [2025-01-09 21:32:46,818 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 497 transitions, 1025 flow [2025-01-09 21:32:46,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:46,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:46,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:46,819 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:46,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash -130146834, now seen corresponding path program 1 times [2025-01-09 21:32:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052970188] [2025-01-09 21:32:46,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 21:32:46,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:32:46,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,853 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:32:46,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052970188] [2025-01-09 21:32:46,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052970188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735372870] [2025-01-09 21:32:46,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:46,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 497 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:46,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,980 INFO L124 PetriNetUnfolderBase]: 155/785 cut-off events. [2025-01-09 21:32:46,980 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 21:32:46,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 785 events. 155/785 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1691 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 947. Up to 171 conditions per place. [2025-01-09 21:32:46,985 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 27 selfloop transitions, 2 changer transitions 0/496 dead transitions. [2025-01-09 21:32:46,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 496 transitions, 1081 flow [2025-01-09 21:32:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:46,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:46,988 INFO L175 Difference]: Start difference. First operand has 485 places, 497 transitions, 1025 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:46,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 496 transitions, 1081 flow [2025-01-09 21:32:46,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 496 transitions, 1080 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:46,994 INFO L231 Difference]: Finished difference. Result has 485 places, 496 transitions, 1026 flow [2025-01-09 21:32:46,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=485, PETRI_TRANSITIONS=496} [2025-01-09 21:32:46,995 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -163 predicate places. [2025-01-09 21:32:46,995 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 496 transitions, 1026 flow [2025-01-09 21:32:46,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:46,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:46,996 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:46,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash -49001284, now seen corresponding path program 1 times [2025-01-09 21:32:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060502404] [2025-01-09 21:32:46,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:47,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:32:47,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:32:47,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:47,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:47,033 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:32:47,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060502404] [2025-01-09 21:32:47,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060502404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:47,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:47,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:47,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533636530] [2025-01-09 21:32:47,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:47,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:47,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:47,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:47,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:47,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 696 [2025-01-09 21:32:47,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 496 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:47,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:47,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 696 [2025-01-09 21:32:47,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:47,167 INFO L124 PetriNetUnfolderBase]: 155/784 cut-off events. [2025-01-09 21:32:47,167 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 21:32:47,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 784 events. 155/784 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1692 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 949. Up to 172 conditions per place. [2025-01-09 21:32:47,172 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 28 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2025-01-09 21:32:47,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 495 transitions, 1084 flow [2025-01-09 21:32:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-01-09 21:32:47,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.742816091954023 [2025-01-09 21:32:47,175 INFO L175 Difference]: Start difference. First operand has 485 places, 496 transitions, 1026 flow. Second operand 3 states and 1551 transitions. [2025-01-09 21:32:47,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 495 transitions, 1084 flow [2025-01-09 21:32:47,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 495 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:47,183 INFO L231 Difference]: Finished difference. Result has 484 places, 495 transitions, 1024 flow [2025-01-09 21:32:47,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=484, PETRI_TRANSITIONS=495} [2025-01-09 21:32:47,188 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -164 predicate places. [2025-01-09 21:32:47,188 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 495 transitions, 1024 flow [2025-01-09 21:32:47,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:47,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:47,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:47,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:32:47,189 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:47,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1824057145, now seen corresponding path program 1 times [2025-01-09 21:32:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:47,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017614714] [2025-01-09 21:32:47,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:47,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:32:47,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:32:47,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:47,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:47,224 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:32:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:47,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017614714] [2025-01-09 21:32:47,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017614714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:47,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:47,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:47,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462713125] [2025-01-09 21:32:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:47,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:47,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:47,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:47,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:47,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 696 [2025-01-09 21:32:47,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 495 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:47,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:47,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 696 [2025-01-09 21:32:47,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:47,419 INFO L124 PetriNetUnfolderBase]: 295/1159 cut-off events. [2025-01-09 21:32:47,420 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-01-09 21:32:47,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 1159 events. 295/1159 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3812 event pairs, 10 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1518. Up to 166 conditions per place. [2025-01-09 21:32:47,434 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 47 selfloop transitions, 2 changer transitions 0/516 dead transitions. [2025-01-09 21:32:47,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 516 transitions, 1186 flow [2025-01-09 21:32:47,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1578 transitions. [2025-01-09 21:32:47,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7557471264367817 [2025-01-09 21:32:47,438 INFO L175 Difference]: Start difference. First operand has 484 places, 495 transitions, 1024 flow. Second operand 3 states and 1578 transitions. [2025-01-09 21:32:47,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 516 transitions, 1186 flow [2025-01-09 21:32:47,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 516 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:47,445 INFO L231 Difference]: Finished difference. Result has 484 places, 495 transitions, 1028 flow [2025-01-09 21:32:47,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=484, PETRI_TRANSITIONS=495} [2025-01-09 21:32:47,446 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -164 predicate places. [2025-01-09 21:32:47,446 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 495 transitions, 1028 flow [2025-01-09 21:32:47,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:47,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:47,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:47,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:32:47,447 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:47,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash -78180114, now seen corresponding path program 1 times [2025-01-09 21:32:47,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:47,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167005598] [2025-01-09 21:32:47,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:47,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:47,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:32:47,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:32:47,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:47,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:47,486 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:32:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167005598] [2025-01-09 21:32:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167005598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5489676] [2025-01-09 21:32:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:47,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:47,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:47,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:47,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:47,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 495 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:47,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:47,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:47,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:47,683 INFO L124 PetriNetUnfolderBase]: 291/1100 cut-off events. [2025-01-09 21:32:47,683 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-01-09 21:32:47,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 1100 events. 291/1100 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3454 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1495. Up to 323 conditions per place. [2025-01-09 21:32:47,693 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 28 selfloop transitions, 2 changer transitions 0/494 dead transitions. [2025-01-09 21:32:47,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 494 transitions, 1086 flow [2025-01-09 21:32:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:47,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:47,696 INFO L175 Difference]: Start difference. First operand has 484 places, 495 transitions, 1028 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:47,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 494 transitions, 1086 flow [2025-01-09 21:32:47,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 494 transitions, 1084 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:47,701 INFO L231 Difference]: Finished difference. Result has 484 places, 494 transitions, 1028 flow [2025-01-09 21:32:47,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=484, PETRI_TRANSITIONS=494} [2025-01-09 21:32:47,702 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -164 predicate places. [2025-01-09 21:32:47,702 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 494 transitions, 1028 flow [2025-01-09 21:32:47,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:47,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:47,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:47,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:32:47,703 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:47,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash -389640483, now seen corresponding path program 1 times [2025-01-09 21:32:47,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:47,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119575955] [2025-01-09 21:32:47,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:47,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:47,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 21:32:47,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 21:32:47,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:47,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:47,758 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:32:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:47,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119575955] [2025-01-09 21:32:47,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119575955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:47,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:47,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:47,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344556464] [2025-01-09 21:32:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:47,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:47,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:47,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:47,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 696 [2025-01-09 21:32:47,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 494 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:47,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:47,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 696 [2025-01-09 21:32:47,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:48,110 INFO L124 PetriNetUnfolderBase]: 291/1099 cut-off events. [2025-01-09 21:32:48,110 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-09 21:32:48,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1099 events. 291/1099 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3444 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1485. Up to 324 conditions per place. [2025-01-09 21:32:48,122 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 29 selfloop transitions, 2 changer transitions 0/493 dead transitions. [2025-01-09 21:32:48,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 493 transitions, 1088 flow [2025-01-09 21:32:48,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-01-09 21:32:48,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.742816091954023 [2025-01-09 21:32:48,125 INFO L175 Difference]: Start difference. First operand has 484 places, 494 transitions, 1028 flow. Second operand 3 states and 1551 transitions. [2025-01-09 21:32:48,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 493 transitions, 1088 flow [2025-01-09 21:32:48,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 493 transitions, 1084 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:48,130 INFO L231 Difference]: Finished difference. Result has 483 places, 493 transitions, 1026 flow [2025-01-09 21:32:48,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=483, PETRI_TRANSITIONS=493} [2025-01-09 21:32:48,131 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -165 predicate places. [2025-01-09 21:32:48,131 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 493 transitions, 1026 flow [2025-01-09 21:32:48,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:48,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:48,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:48,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:32:48,132 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:48,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash -116821325, now seen corresponding path program 1 times [2025-01-09 21:32:48,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:48,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891000109] [2025-01-09 21:32:48,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:48,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:48,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:32:48,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:32:48,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:48,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:48,178 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:32:48,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:48,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891000109] [2025-01-09 21:32:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891000109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:48,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:48,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:48,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119990963] [2025-01-09 21:32:48,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:48,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:48,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:48,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:48,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:48,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 696 [2025-01-09 21:32:48,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 493 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:48,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:48,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 696 [2025-01-09 21:32:48,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:48,415 INFO L124 PetriNetUnfolderBase]: 291/1098 cut-off events. [2025-01-09 21:32:48,416 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-01-09 21:32:48,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 1098 events. 291/1098 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3446 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1482. Up to 321 conditions per place. [2025-01-09 21:32:48,427 INFO L140 encePairwiseOnDemand]: 694/696 looper letters, 27 selfloop transitions, 1 changer transitions 0/492 dead transitions. [2025-01-09 21:32:48,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 492 transitions, 1080 flow [2025-01-09 21:32:48,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-01-09 21:32:48,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2025-01-09 21:32:48,431 INFO L175 Difference]: Start difference. First operand has 483 places, 493 transitions, 1026 flow. Second operand 3 states and 1560 transitions. [2025-01-09 21:32:48,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 492 transitions, 1080 flow [2025-01-09 21:32:48,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 492 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:48,437 INFO L231 Difference]: Finished difference. Result has 482 places, 492 transitions, 1022 flow [2025-01-09 21:32:48,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1022, PETRI_PLACES=482, PETRI_TRANSITIONS=492} [2025-01-09 21:32:48,438 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -166 predicate places. [2025-01-09 21:32:48,438 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 492 transitions, 1022 flow [2025-01-09 21:32:48,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:48,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:48,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:48,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:32:48,443 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:48,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -777382708, now seen corresponding path program 1 times [2025-01-09 21:32:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:48,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615469193] [2025-01-09 21:32:48,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:48,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 21:32:48,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 21:32:48,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:48,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:48,519 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:32:48,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:48,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615469193] [2025-01-09 21:32:48,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615469193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:48,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:48,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683046163] [2025-01-09 21:32:48,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:48,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:48,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:48,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:48,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 492 transitions, 1022 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:48,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:48,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:48,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:48,713 INFO L124 PetriNetUnfolderBase]: 291/1097 cut-off events. [2025-01-09 21:32:48,713 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-09 21:32:48,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 1097 events. 291/1097 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3437 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1481. Up to 323 conditions per place. [2025-01-09 21:32:48,724 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 28 selfloop transitions, 2 changer transitions 0/491 dead transitions. [2025-01-09 21:32:48,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 491 transitions, 1080 flow [2025-01-09 21:32:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:48,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:48,727 INFO L175 Difference]: Start difference. First operand has 482 places, 492 transitions, 1022 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:48,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 491 transitions, 1080 flow [2025-01-09 21:32:48,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 491 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:48,733 INFO L231 Difference]: Finished difference. Result has 482 places, 491 transitions, 1023 flow [2025-01-09 21:32:48,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=482, PETRI_TRANSITIONS=491} [2025-01-09 21:32:48,734 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -166 predicate places. [2025-01-09 21:32:48,734 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 491 transitions, 1023 flow [2025-01-09 21:32:48,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:48,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:48,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:48,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:32:48,735 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:48,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1518446257, now seen corresponding path program 1 times [2025-01-09 21:32:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:48,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829238266] [2025-01-09 21:32:48,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:48,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 21:32:48,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 21:32:48,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:48,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:48,781 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:32:48,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829238266] [2025-01-09 21:32:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829238266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:48,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:48,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:48,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410106827] [2025-01-09 21:32:48,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:48,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:48,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:48,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:48,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 696 [2025-01-09 21:32:48,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 491 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:48,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:48,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 696 [2025-01-09 21:32:48,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:48,980 INFO L124 PetriNetUnfolderBase]: 291/1096 cut-off events. [2025-01-09 21:32:48,980 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-09 21:32:48,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 1096 events. 291/1096 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3424 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1483. Up to 324 conditions per place. [2025-01-09 21:32:48,989 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 29 selfloop transitions, 2 changer transitions 0/490 dead transitions. [2025-01-09 21:32:48,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 490 transitions, 1083 flow [2025-01-09 21:32:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-01-09 21:32:48,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.742816091954023 [2025-01-09 21:32:48,992 INFO L175 Difference]: Start difference. First operand has 482 places, 491 transitions, 1023 flow. Second operand 3 states and 1551 transitions. [2025-01-09 21:32:48,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 490 transitions, 1083 flow [2025-01-09 21:32:48,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 490 transitions, 1079 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:48,998 INFO L231 Difference]: Finished difference. Result has 481 places, 490 transitions, 1021 flow [2025-01-09 21:32:48,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=481, PETRI_TRANSITIONS=490} [2025-01-09 21:32:48,999 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -167 predicate places. [2025-01-09 21:32:48,999 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 490 transitions, 1021 flow [2025-01-09 21:32:49,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:49,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:49,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:49,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:32:49,001 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:49,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1490078314, now seen corresponding path program 1 times [2025-01-09 21:32:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:49,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861415345] [2025-01-09 21:32:49,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:49,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:32:49,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:32:49,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:49,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:49,052 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:32:49,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:49,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861415345] [2025-01-09 21:32:49,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861415345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:49,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:49,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:49,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731596932] [2025-01-09 21:32:49,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:49,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:49,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:49,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:49,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:49,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 696 [2025-01-09 21:32:49,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 490 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:49,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:49,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 696 [2025-01-09 21:32:49,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:49,401 INFO L124 PetriNetUnfolderBase]: 547/1955 cut-off events. [2025-01-09 21:32:49,401 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-01-09 21:32:49,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1955 events. 547/1955 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9208 event pairs, 34 based on Foata normal form. 0/1623 useless extension candidates. Maximal degree in co-relation 2700. Up to 298 conditions per place. [2025-01-09 21:32:49,416 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 48 selfloop transitions, 2 changer transitions 0/511 dead transitions. [2025-01-09 21:32:49,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 511 transitions, 1188 flow [2025-01-09 21:32:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1577 transitions. [2025-01-09 21:32:49,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552681992337165 [2025-01-09 21:32:49,420 INFO L175 Difference]: Start difference. First operand has 481 places, 490 transitions, 1021 flow. Second operand 3 states and 1577 transitions. [2025-01-09 21:32:49,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 511 transitions, 1188 flow [2025-01-09 21:32:49,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 511 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:49,425 INFO L231 Difference]: Finished difference. Result has 481 places, 490 transitions, 1025 flow [2025-01-09 21:32:49,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=481, PETRI_TRANSITIONS=490} [2025-01-09 21:32:49,426 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -167 predicate places. [2025-01-09 21:32:49,426 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 490 transitions, 1025 flow [2025-01-09 21:32:49,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:49,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:49,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:49,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:32:49,427 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:49,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1908984796, now seen corresponding path program 1 times [2025-01-09 21:32:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:49,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037028790] [2025-01-09 21:32:49,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:49,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 21:32:49,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 21:32:49,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:49,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:49,480 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:32:49,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:49,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037028790] [2025-01-09 21:32:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037028790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:49,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:49,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073475880] [2025-01-09 21:32:49,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:49,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:49,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:49,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:49,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:49,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:49,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 490 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:49,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:49,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:49,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:49,743 INFO L124 PetriNetUnfolderBase]: 527/1602 cut-off events. [2025-01-09 21:32:49,743 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-01-09 21:32:49,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 1602 events. 527/1602 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6431 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2431. Up to 591 conditions per place. [2025-01-09 21:32:49,763 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 29 selfloop transitions, 2 changer transitions 0/489 dead transitions. [2025-01-09 21:32:49,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 489 transitions, 1085 flow [2025-01-09 21:32:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:49,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:49,766 INFO L175 Difference]: Start difference. First operand has 481 places, 490 transitions, 1025 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:49,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 489 transitions, 1085 flow [2025-01-09 21:32:49,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 489 transitions, 1083 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:49,771 INFO L231 Difference]: Finished difference. Result has 481 places, 489 transitions, 1025 flow [2025-01-09 21:32:49,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=481, PETRI_TRANSITIONS=489} [2025-01-09 21:32:49,772 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -167 predicate places. [2025-01-09 21:32:49,772 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 489 transitions, 1025 flow [2025-01-09 21:32:49,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:49,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:49,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:49,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:32:49,773 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:49,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1689938460, now seen corresponding path program 1 times [2025-01-09 21:32:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026163294] [2025-01-09 21:32:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:49,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 21:32:49,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 21:32:49,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:49,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026163294] [2025-01-09 21:32:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026163294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476406664] [2025-01-09 21:32:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:49,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:49,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:49,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 696 [2025-01-09 21:32:49,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 489 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:49,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:49,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 696 [2025-01-09 21:32:49,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:50,095 INFO L124 PetriNetUnfolderBase]: 527/1601 cut-off events. [2025-01-09 21:32:50,095 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-01-09 21:32:50,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 1601 events. 527/1601 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6445 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2405. Up to 592 conditions per place. [2025-01-09 21:32:50,112 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 30 selfloop transitions, 2 changer transitions 0/488 dead transitions. [2025-01-09 21:32:50,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 488 transitions, 1087 flow [2025-01-09 21:32:50,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-01-09 21:32:50,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.742816091954023 [2025-01-09 21:32:50,115 INFO L175 Difference]: Start difference. First operand has 481 places, 489 transitions, 1025 flow. Second operand 3 states and 1551 transitions. [2025-01-09 21:32:50,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 488 transitions, 1087 flow [2025-01-09 21:32:50,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 488 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:50,120 INFO L231 Difference]: Finished difference. Result has 480 places, 488 transitions, 1023 flow [2025-01-09 21:32:50,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=480, PETRI_TRANSITIONS=488} [2025-01-09 21:32:50,121 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -168 predicate places. [2025-01-09 21:32:50,121 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 488 transitions, 1023 flow [2025-01-09 21:32:50,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:50,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:50,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:50,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:32:50,122 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:50,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:50,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1440981134, now seen corresponding path program 1 times [2025-01-09 21:32:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:50,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826640182] [2025-01-09 21:32:50,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:50,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:50,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 21:32:50,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 21:32:50,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:50,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:50,165 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:32:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:50,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826640182] [2025-01-09 21:32:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826640182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:50,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:50,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493134316] [2025-01-09 21:32:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:50,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:50,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:50,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:50,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 696 [2025-01-09 21:32:50,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 488 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:50,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:50,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 696 [2025-01-09 21:32:50,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:50,621 INFO L124 PetriNetUnfolderBase]: 527/1600 cut-off events. [2025-01-09 21:32:50,625 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-01-09 21:32:50,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1600 events. 527/1600 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6436 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2402. Up to 589 conditions per place. [2025-01-09 21:32:50,669 INFO L140 encePairwiseOnDemand]: 694/696 looper letters, 28 selfloop transitions, 1 changer transitions 0/487 dead transitions. [2025-01-09 21:32:50,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 487 transitions, 1079 flow [2025-01-09 21:32:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-01-09 21:32:50,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2025-01-09 21:32:50,676 INFO L175 Difference]: Start difference. First operand has 480 places, 488 transitions, 1023 flow. Second operand 3 states and 1560 transitions. [2025-01-09 21:32:50,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 487 transitions, 1079 flow [2025-01-09 21:32:50,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 487 transitions, 1075 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:50,687 INFO L231 Difference]: Finished difference. Result has 479 places, 487 transitions, 1019 flow [2025-01-09 21:32:50,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1019, PETRI_PLACES=479, PETRI_TRANSITIONS=487} [2025-01-09 21:32:50,691 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -169 predicate places. [2025-01-09 21:32:50,692 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 487 transitions, 1019 flow [2025-01-09 21:32:50,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:32:50,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:50,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:50,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:32:50,696 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:50,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1351723236, now seen corresponding path program 1 times [2025-01-09 21:32:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:50,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491310633] [2025-01-09 21:32:50,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:50,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:50,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 21:32:50,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 21:32:50,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:50,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:50,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:50,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491310633] [2025-01-09 21:32:50,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491310633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:50,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:50,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:50,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931814818] [2025-01-09 21:32:50,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:50,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:50,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:50,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:50,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:50,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:50,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 487 transitions, 1019 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:50,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:50,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:50,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:51,425 INFO L124 PetriNetUnfolderBase]: 527/1599 cut-off events. [2025-01-09 21:32:51,425 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-01-09 21:32:51,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1599 events. 527/1599 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6432 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2401. Up to 591 conditions per place. [2025-01-09 21:32:51,462 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 29 selfloop transitions, 2 changer transitions 0/486 dead transitions. [2025-01-09 21:32:51,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 486 transitions, 1079 flow [2025-01-09 21:32:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:51,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:51,468 INFO L175 Difference]: Start difference. First operand has 479 places, 487 transitions, 1019 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:51,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 486 transitions, 1079 flow [2025-01-09 21:32:51,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 486 transitions, 1078 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:51,480 INFO L231 Difference]: Finished difference. Result has 479 places, 486 transitions, 1020 flow [2025-01-09 21:32:51,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1020, PETRI_PLACES=479, PETRI_TRANSITIONS=486} [2025-01-09 21:32:51,481 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -169 predicate places. [2025-01-09 21:32:51,481 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 486 transitions, 1020 flow [2025-01-09 21:32:51,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:51,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:51,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:51,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:32:51,482 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1889068950, now seen corresponding path program 1 times [2025-01-09 21:32:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:51,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687792636] [2025-01-09 21:32:51,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:51,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-01-09 21:32:51,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-01-09 21:32:51,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:51,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:51,541 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:32:51,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:51,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687792636] [2025-01-09 21:32:51,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687792636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:51,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:51,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125266505] [2025-01-09 21:32:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:51,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:51,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:51,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:51,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:51,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 486 transitions, 1020 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:51,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:51,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:51,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:51,797 INFO L124 PetriNetUnfolderBase]: 527/1598 cut-off events. [2025-01-09 21:32:51,797 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-01-09 21:32:51,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 1598 events. 527/1598 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6420 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2402. Up to 591 conditions per place. [2025-01-09 21:32:51,813 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 29 selfloop transitions, 2 changer transitions 0/485 dead transitions. [2025-01-09 21:32:51,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 485 transitions, 1080 flow [2025-01-09 21:32:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:51,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:51,815 INFO L175 Difference]: Start difference. First operand has 479 places, 486 transitions, 1020 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:51,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 485 transitions, 1080 flow [2025-01-09 21:32:51,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 485 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:51,819 INFO L231 Difference]: Finished difference. Result has 478 places, 485 transitions, 1018 flow [2025-01-09 21:32:51,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1018, PETRI_PLACES=478, PETRI_TRANSITIONS=485} [2025-01-09 21:32:51,821 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -170 predicate places. [2025-01-09 21:32:51,821 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 485 transitions, 1018 flow [2025-01-09 21:32:51,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:51,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:51,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:51,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:32:51,822 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:51,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:51,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1446701164, now seen corresponding path program 1 times [2025-01-09 21:32:51,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:51,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538900785] [2025-01-09 21:32:51,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:51,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:51,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-09 21:32:51,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-09 21:32:51,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:51,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:51,868 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:32:51,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:51,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538900785] [2025-01-09 21:32:51,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538900785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:51,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:51,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:51,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735100668] [2025-01-09 21:32:51,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:51,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:51,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:51,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:51,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 696 [2025-01-09 21:32:51,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 485 transitions, 1018 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:51,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:51,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 696 [2025-01-09 21:32:51,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:52,115 INFO L124 PetriNetUnfolderBase]: 527/1597 cut-off events. [2025-01-09 21:32:52,116 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-01-09 21:32:52,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1597 events. 527/1597 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6434 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2401. Up to 591 conditions per place. [2025-01-09 21:32:52,136 INFO L140 encePairwiseOnDemand]: 693/696 looper letters, 29 selfloop transitions, 2 changer transitions 0/484 dead transitions. [2025-01-09 21:32:52,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 484 transitions, 1078 flow [2025-01-09 21:32:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-01-09 21:32:52,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7437739463601533 [2025-01-09 21:32:52,139 INFO L175 Difference]: Start difference. First operand has 478 places, 485 transitions, 1018 flow. Second operand 3 states and 1553 transitions. [2025-01-09 21:32:52,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 484 transitions, 1078 flow [2025-01-09 21:32:52,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 484 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:52,146 INFO L231 Difference]: Finished difference. Result has 477 places, 484 transitions, 1016 flow [2025-01-09 21:32:52,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=477, PETRI_TRANSITIONS=484} [2025-01-09 21:32:52,147 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -171 predicate places. [2025-01-09 21:32:52,147 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 484 transitions, 1016 flow [2025-01-09 21:32:52,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:52,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:52,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:52,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:32:52,148 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:52,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:52,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1794183568, now seen corresponding path program 1 times [2025-01-09 21:32:52,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:52,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418438769] [2025-01-09 21:32:52,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:52,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 21:32:52,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 21:32:52,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:52,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:52,215 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:32:52,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:52,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418438769] [2025-01-09 21:32:52,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418438769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:52,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:52,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:52,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92364073] [2025-01-09 21:32:52,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:52,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:52,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:52,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:52,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 696 [2025-01-09 21:32:52,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 484 transitions, 1016 flow. Second operand has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 0 states have call successors, (0), 0 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:32:52,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:52,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 696 [2025-01-09 21:32:52,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:53,260 INFO L124 PetriNetUnfolderBase]: 2651/6526 cut-off events. [2025-01-09 21:32:53,261 INFO L125 PetriNetUnfolderBase]: For 1198/1198 co-relation queries the response was YES. [2025-01-09 21:32:53,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10925 conditions, 6526 events. 2651/6526 cut-off events. For 1198/1198 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 48389 event pairs, 378 based on Foata normal form. 0/5411 useless extension candidates. Maximal degree in co-relation 10852. Up to 2446 conditions per place. [2025-01-09 21:32:53,329 INFO L140 encePairwiseOnDemand]: 683/696 looper letters, 45 selfloop transitions, 10 changer transitions 0/495 dead transitions. [2025-01-09 21:32:53,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 495 transitions, 1167 flow [2025-01-09 21:32:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1546 transitions. [2025-01-09 21:32:53,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7404214559386973 [2025-01-09 21:32:53,331 INFO L175 Difference]: Start difference. First operand has 477 places, 484 transitions, 1016 flow. Second operand 3 states and 1546 transitions. [2025-01-09 21:32:53,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 495 transitions, 1167 flow [2025-01-09 21:32:53,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 495 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:53,337 INFO L231 Difference]: Finished difference. Result has 472 places, 479 transitions, 1034 flow [2025-01-09 21:32:53,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1034, PETRI_PLACES=472, PETRI_TRANSITIONS=479} [2025-01-09 21:32:53,339 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-01-09 21:32:53,339 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 479 transitions, 1034 flow [2025-01-09 21:32:53,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 0 states have call successors, (0), 0 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:32:53,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:53,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:53,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:32:53,340 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:53,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash -629818844, now seen corresponding path program 1 times [2025-01-09 21:32:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:53,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784044021] [2025-01-09 21:32:53,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:53,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-09 21:32:53,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-09 21:32:53,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:53,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:53,407 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:32:53,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:53,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784044021] [2025-01-09 21:32:53,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784044021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:53,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:53,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:53,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997609288] [2025-01-09 21:32:53,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:53,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:53,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:53,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:53,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:53,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 696 [2025-01-09 21:32:53,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 479 transitions, 1034 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:53,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:53,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 696 [2025-01-09 21:32:53,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:54,612 INFO L124 PetriNetUnfolderBase]: 2649/5021 cut-off events. [2025-01-09 21:32:54,613 INFO L125 PetriNetUnfolderBase]: For 4812/4858 co-relation queries the response was YES. [2025-01-09 21:32:54,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10266 conditions, 5021 events. 2649/5021 cut-off events. For 4812/4858 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 27383 event pairs, 130 based on Foata normal form. 0/4407 useless extension candidates. Maximal degree in co-relation 10193. Up to 2268 conditions per place. [2025-01-09 21:32:54,658 INFO L140 encePairwiseOnDemand]: 691/696 looper letters, 48 selfloop transitions, 4 changer transitions 0/499 dead transitions. [2025-01-09 21:32:54,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 499 transitions, 1231 flow [2025-01-09 21:32:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1573 transitions. [2025-01-09 21:32:54,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7533524904214559 [2025-01-09 21:32:54,660 INFO L175 Difference]: Start difference. First operand has 472 places, 479 transitions, 1034 flow. Second operand 3 states and 1573 transitions. [2025-01-09 21:32:54,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 499 transitions, 1231 flow [2025-01-09 21:32:54,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 499 transitions, 1212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:54,667 INFO L231 Difference]: Finished difference. Result has 472 places, 478 transitions, 1036 flow [2025-01-09 21:32:54,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=472, PETRI_TRANSITIONS=478} [2025-01-09 21:32:54,668 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-01-09 21:32:54,668 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 478 transitions, 1036 flow [2025-01-09 21:32:54,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:54,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:54,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:54,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:32:54,669 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:54,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 326315565, now seen corresponding path program 1 times [2025-01-09 21:32:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560415312] [2025-01-09 21:32:54,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:54,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 21:32:54,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 21:32:54,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:54,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:54,716 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:32:54,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:54,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560415312] [2025-01-09 21:32:54,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560415312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:54,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:54,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:54,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852764532] [2025-01-09 21:32:54,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:54,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:54,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:54,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:54,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:54,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 696 [2025-01-09 21:32:54,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 478 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:54,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:54,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 696 [2025-01-09 21:32:54,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:55,990 INFO L124 PetriNetUnfolderBase]: 3557/7793 cut-off events. [2025-01-09 21:32:55,991 INFO L125 PetriNetUnfolderBase]: For 5261/5387 co-relation queries the response was YES. [2025-01-09 21:32:56,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14989 conditions, 7793 events. 3557/7793 cut-off events. For 5261/5387 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 54900 event pairs, 418 based on Foata normal form. 0/6667 useless extension candidates. Maximal degree in co-relation 14915. Up to 3192 conditions per place. [2025-01-09 21:32:56,074 INFO L140 encePairwiseOnDemand]: 691/696 looper letters, 47 selfloop transitions, 4 changer transitions 0/497 dead transitions. [2025-01-09 21:32:56,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 497 transitions, 1228 flow [2025-01-09 21:32:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1572 transitions. [2025-01-09 21:32:56,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7528735632183908 [2025-01-09 21:32:56,076 INFO L175 Difference]: Start difference. First operand has 472 places, 478 transitions, 1036 flow. Second operand 3 states and 1572 transitions. [2025-01-09 21:32:56,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 497 transitions, 1228 flow [2025-01-09 21:32:56,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 497 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:56,083 INFO L231 Difference]: Finished difference. Result has 472 places, 477 transitions, 1044 flow [2025-01-09 21:32:56,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=472, PETRI_TRANSITIONS=477} [2025-01-09 21:32:56,083 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-01-09 21:32:56,083 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 477 transitions, 1044 flow [2025-01-09 21:32:56,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:56,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:56,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:56,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:32:56,084 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:56,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash 983335788, now seen corresponding path program 1 times [2025-01-09 21:32:56,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:56,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922858126] [2025-01-09 21:32:56,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:56,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:56,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 21:32:56,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 21:32:56,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:56,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:56,129 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:32:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922858126] [2025-01-09 21:32:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922858126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:56,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053007587] [2025-01-09 21:32:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:56,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:56,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:56,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:56,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 696 [2025-01-09 21:32:56,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 477 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 0 states have call successors, (0), 0 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:32:56,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:56,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 696 [2025-01-09 21:32:56,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:57,654 INFO L124 PetriNetUnfolderBase]: 3823/9663 cut-off events. [2025-01-09 21:32:57,654 INFO L125 PetriNetUnfolderBase]: For 8565/8581 co-relation queries the response was YES. [2025-01-09 21:32:57,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18552 conditions, 9663 events. 3823/9663 cut-off events. For 8565/8581 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 84115 event pairs, 210 based on Foata normal form. 0/8234 useless extension candidates. Maximal degree in co-relation 18477. Up to 3888 conditions per place. [2025-01-09 21:32:57,754 INFO L140 encePairwiseOnDemand]: 691/696 looper letters, 46 selfloop transitions, 4 changer transitions 0/495 dead transitions. [2025-01-09 21:32:57,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 495 transitions, 1237 flow [2025-01-09 21:32:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1571 transitions. [2025-01-09 21:32:57,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7523946360153256 [2025-01-09 21:32:57,761 INFO L175 Difference]: Start difference. First operand has 472 places, 477 transitions, 1044 flow. Second operand 3 states and 1571 transitions. [2025-01-09 21:32:57,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 495 transitions, 1237 flow [2025-01-09 21:32:57,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 495 transitions, 1230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:57,775 INFO L231 Difference]: Finished difference. Result has 472 places, 476 transitions, 1052 flow [2025-01-09 21:32:57,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=472, PETRI_TRANSITIONS=476} [2025-01-09 21:32:57,775 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-01-09 21:32:57,775 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 476 transitions, 1052 flow [2025-01-09 21:32:57,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 0 states have call successors, (0), 0 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:32:57,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:57,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:57,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:32:57,776 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-01-09 21:32:57,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1122102051, now seen corresponding path program 1 times [2025-01-09 21:32:57,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:57,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687105398] [2025-01-09 21:32:57,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:57,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:57,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 21:32:57,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 21:32:57,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:57,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:57,918 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:32:57,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:57,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687105398] [2025-01-09 21:32:57,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687105398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:57,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:57,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231950848] [2025-01-09 21:32:57,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:57,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:57,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:57,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:57,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 696 [2025-01-09 21:32:57,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 476 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 515.6666666666666) internal successors, (1547), 3 states have internal predecessors, (1547), 0 states have call successors, (0), 0 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:32:57,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:57,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 696 [2025-01-09 21:32:57,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:58,775 INFO L124 PetriNetUnfolderBase]: 1053/3301 cut-off events. [2025-01-09 21:32:58,776 INFO L125 PetriNetUnfolderBase]: For 3308/3332 co-relation queries the response was YES. [2025-01-09 21:32:58,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6754 conditions, 3301 events. 1053/3301 cut-off events. For 3308/3332 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 21655 event pairs, 210 based on Foata normal form. 256/3051 useless extension candidates. Maximal degree in co-relation 6677. Up to 1517 conditions per place. [2025-01-09 21:32:58,800 INFO L140 encePairwiseOnDemand]: 694/696 looper letters, 0 selfloop transitions, 0 changer transitions 475/475 dead transitions. [2025-01-09 21:32:58,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 475 transitions, 1106 flow [2025-01-09 21:32:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1559 transitions. [2025-01-09 21:32:58,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7466475095785441 [2025-01-09 21:32:58,803 INFO L175 Difference]: Start difference. First operand has 472 places, 476 transitions, 1052 flow. Second operand 3 states and 1559 transitions. [2025-01-09 21:32:58,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 475 transitions, 1106 flow [2025-01-09 21:32:58,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 475 transitions, 1102 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:58,808 INFO L231 Difference]: Finished difference. Result has 472 places, 0 transitions, 0 flow [2025-01-09 21:32:58,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=696, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=472, PETRI_TRANSITIONS=0} [2025-01-09 21:32:58,808 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-01-09 21:32:58,809 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 0 transitions, 0 flow [2025-01-09 21:32:58,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 515.6666666666666) internal successors, (1547), 3 states have internal predecessors, (1547), 0 states have call successors, (0), 0 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:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (335 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (334 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (333 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (332 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (331 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (330 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (329 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (328 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (327 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (326 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (325 of 336 remaining) [2025-01-09 21:32:58,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (324 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (323 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (322 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (321 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (320 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (319 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (318 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (317 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (316 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (315 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (314 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (313 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (312 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (311 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (310 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (309 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (308 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (307 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (306 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (305 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (304 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (303 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (302 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (301 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (300 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (299 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (298 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (297 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (296 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (295 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (294 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (293 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (292 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (291 of 336 remaining) [2025-01-09 21:32:58,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (290 of 336 remaining) [2025-01-09 21:32:58,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (289 of 336 remaining) [2025-01-09 21:32:58,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (288 of 336 remaining) [2025-01-09 21:32:58,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (287 of 336 remaining) [2025-01-09 21:32:58,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (286 of 336 remaining) [2025-01-09 21:32:58,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (285 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (284 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (283 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (282 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (281 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (280 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (279 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (278 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (277 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (276 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (275 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (274 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (273 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (272 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (271 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (270 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err66ASSERT_VIOLATIONDATA_RACE (269 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err67ASSERT_VIOLATIONDATA_RACE (268 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err68ASSERT_VIOLATIONDATA_RACE (267 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err69ASSERT_VIOLATIONDATA_RACE (266 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err70ASSERT_VIOLATIONDATA_RACE (265 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err71ASSERT_VIOLATIONDATA_RACE (264 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err72ASSERT_VIOLATIONDATA_RACE (263 of 336 remaining) [2025-01-09 21:32:58,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err73ASSERT_VIOLATIONDATA_RACE (262 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err74ASSERT_VIOLATIONDATA_RACE (261 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (260 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (259 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (258 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (257 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (256 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (255 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (254 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (253 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (252 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (251 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (250 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (249 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (248 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (247 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (246 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (245 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (244 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (243 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (242 of 336 remaining) [2025-01-09 21:32:58,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (241 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (240 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (239 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (238 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (237 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (236 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (235 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (234 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (233 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (232 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (231 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (230 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (229 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (228 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (227 of 336 remaining) [2025-01-09 21:32:58,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (226 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (225 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (224 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (223 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (222 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (221 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (220 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (219 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (218 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (217 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (216 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (215 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (214 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (213 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (212 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (211 of 336 remaining) [2025-01-09 21:32:58,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (210 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (209 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (208 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (207 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (206 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (205 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (204 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (203 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (202 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (201 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (200 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (199 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (198 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (197 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (196 of 336 remaining) [2025-01-09 21:32:58,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (195 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (194 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (193 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (192 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (191 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (190 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (189 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (188 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (187 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (186 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (185 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (184 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (183 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (182 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (181 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (180 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (179 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (178 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (177 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (176 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (175 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (174 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (173 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (172 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (171 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (170 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (169 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (168 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (167 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (166 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (165 of 336 remaining) [2025-01-09 21:32:58,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (164 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (163 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (162 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (161 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (160 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (159 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (158 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (157 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (156 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (155 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (154 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (153 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (152 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err23ASSERT_VIOLATIONDATA_RACE (151 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err24ASSERT_VIOLATIONDATA_RACE (150 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (149 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (148 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (147 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (146 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (145 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (144 of 336 remaining) [2025-01-09 21:32:58,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (143 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (142 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (141 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (140 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (139 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (138 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (137 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (136 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (135 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (134 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (133 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (132 of 336 remaining) [2025-01-09 21:32:58,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (131 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (130 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (129 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (128 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (127 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (126 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (125 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (124 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (123 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (122 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (121 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (120 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (119 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (118 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (117 of 336 remaining) [2025-01-09 21:32:58,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (116 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (115 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (114 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (113 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (112 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (111 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (110 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (109 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (108 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (107 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (106 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (105 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (104 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (103 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (102 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (101 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (100 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (99 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (98 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (97 of 336 remaining) [2025-01-09 21:32:58,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (96 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (95 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (94 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (93 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (92 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (91 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (90 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (89 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (88 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (87 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (86 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (85 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (84 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err66ASSERT_VIOLATIONDATA_RACE (83 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err67ASSERT_VIOLATIONDATA_RACE (82 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err68ASSERT_VIOLATIONDATA_RACE (81 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err69ASSERT_VIOLATIONDATA_RACE (80 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err70ASSERT_VIOLATIONDATA_RACE (79 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err71ASSERT_VIOLATIONDATA_RACE (78 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err72ASSERT_VIOLATIONDATA_RACE (77 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err73ASSERT_VIOLATIONDATA_RACE (76 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err74ASSERT_VIOLATIONDATA_RACE (75 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (74 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (73 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (72 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (71 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (70 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (69 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (68 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (67 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (66 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (65 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (64 of 336 remaining) [2025-01-09 21:32:58,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (63 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (62 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (61 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (60 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (59 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (58 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (57 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (56 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (55 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (54 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (53 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (52 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (51 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (50 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (49 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (48 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (47 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (46 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (43 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (42 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (41 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (40 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (39 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (38 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (37 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (36 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (35 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (34 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (33 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (32 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (31 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (30 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (29 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (28 of 336 remaining) [2025-01-09 21:32:58,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (27 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (26 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (25 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (24 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (23 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (22 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (21 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (20 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (19 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (18 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (17 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (16 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (15 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (14 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (13 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (11 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (10 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (9 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (8 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (7 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (6 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (5 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (4 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (3 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (2 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err23ASSERT_VIOLATIONDATA_RACE (1 of 336 remaining) [2025-01-09 21:32:58,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err24ASSERT_VIOLATIONDATA_RACE (0 of 336 remaining) [2025-01-09 21:32:58,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:32:58,829 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:58,833 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:58,834 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:58,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:58 BasicIcfg [2025-01-09 21:32:58,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:58,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:58,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:58,839 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:58,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:42" (3/4) ... [2025-01-09 21:32:58,840 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:58,842 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:58,842 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:58,842 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:58,842 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:32:58,848 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-01-09 21:32:58,848 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:58,849 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:32:58,849 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:58,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:58,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:58,924 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:58,925 INFO L158 Benchmark]: Toolchain (without parser) took 18861.65ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 112.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 806.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:58,926 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:58,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.29ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 95.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:58,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.42ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 90.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:58,927 INFO L158 Benchmark]: Boogie Preprocessor took 91.06ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 84.9MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:58,927 INFO L158 Benchmark]: RCFGBuilder took 1859.98ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 84.9MB in the beginning and 176.1MB in the end (delta: -91.1MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2025-01-09 21:32:58,927 INFO L158 Benchmark]: TraceAbstraction took 16476.08ms. Allocated memory was 285.2MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 175.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 719.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:58,928 INFO L158 Benchmark]: Witness Printer took 85.75ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:58,929 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.19ms. Allocated memory is still 226.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.29ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 95.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.42ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 90.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.06ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 84.9MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1859.98ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 84.9MB in the beginning and 176.1MB in the end (delta: -91.1MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16476.08ms. Allocated memory was 285.2MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 175.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 719.8MB. Max. memory is 16.1GB. * Witness Printer took 85.75ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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: 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: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 170]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 172]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 174]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 174]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 175]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 175]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 178]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 178]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 179]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 180]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 180]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 182]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 183]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 183]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 184]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 187]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 188]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 188]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 189]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 190]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 190]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 192]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 193]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 205]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 890 locations, 336 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: 16.2s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 365 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1859 IncrementalHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 82 mSDtfsCounter, 1859 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1374occurred in iteration=0, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5785 NumberOfCodeBlocks, 5785 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 5752 ConstructedInterpolants, 0 QuantifiedInterpolants, 5931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 182 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:58,959 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