./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-barrier.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:01,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:02,004 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:02,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:02,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:02,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:02,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:02,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:02,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:02,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:02,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:02,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:02,022 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:02,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:02,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:02,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:02,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:02,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:02,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:02,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:02,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:02,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:02,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:02,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:02,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:02,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:02,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:02,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:02,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:02,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:02,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:02,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:02,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:02,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:02,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:02,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:02,025 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 -> b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c [2025-01-09 21:32:02,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:02,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:02,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:02,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:02,189 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:02,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-01-09 21:32:03,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09db6adfa/eadf48fb71a74c42bab0fbffe8120115/FLAGae691b7fe [2025-01-09 21:32:03,618 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:03,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-01-09 21:32:03,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09db6adfa/eadf48fb71a74c42bab0fbffe8120115/FLAGae691b7fe [2025-01-09 21:32:03,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09db6adfa/eadf48fb71a74c42bab0fbffe8120115 [2025-01-09 21:32:03,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:03,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:03,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:03,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:03,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:03,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03, skipping insertion in model container [2025-01-09 21:32:03,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:03,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:03,834 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:03,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:03,874 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:03,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03 WrapperNode [2025-01-09 21:32:03,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:03,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:03,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:03,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:03,881 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:03" (1/1) ... [2025-01-09 21:32:03,886 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:03" (1/1) ... [2025-01-09 21:32:03,910 INFO L138 Inliner]: procedures = 22, calls = 21, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 276 [2025-01-09 21:32:03,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:03,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:03,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:03,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:03,916 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:03" (1/1) ... [2025-01-09 21:32:03,916 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:03" (1/1) ... [2025-01-09 21:32:03,919 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:03" (1/1) ... [2025-01-09 21:32:03,920 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:03" (1/1) ... [2025-01-09 21:32:03,924 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:03" (1/1) ... [2025-01-09 21:32:03,924 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:03" (1/1) ... [2025-01-09 21:32:03,926 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:03" (1/1) ... [2025-01-09 21:32:03,927 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:03" (1/1) ... [2025-01-09 21:32:03,927 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:03" (1/1) ... [2025-01-09 21:32:03,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:03,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:03,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:03,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:03,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:03,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:03,952 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:03,954 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:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:32:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:32:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-09 21:32:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-09 21:32:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-01-09 21:32:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-01-09 21:32:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:03,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:03,970 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:04,040 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:04,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:04,261 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:04,261 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:04,271 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:04,272 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:32:04,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:04 BoogieIcfgContainer [2025-01-09 21:32:04,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:04,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:04,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:04,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:04,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:03" (1/3) ... [2025-01-09 21:32:04,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30815c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:04, skipping insertion in model container [2025-01-09 21:32:04,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (2/3) ... [2025-01-09 21:32:04,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30815c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:04, skipping insertion in model container [2025-01-09 21:32:04,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:04" (3/3) ... [2025-01-09 21:32:04,278 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2025-01-09 21:32:04,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:04,288 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier.wvr.c that has 7 procedures, 310 locations, 1 initial locations, 0 loop locations, and 20 error locations. [2025-01-09 21:32:04,289 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:04,375 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-01-09 21:32:04,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 329 transitions, 724 flow [2025-01-09 21:32:04,497 INFO L124 PetriNetUnfolderBase]: 12/315 cut-off events. [2025-01-09 21:32:04,499 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:32:04,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 315 events. 12/315 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 566 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 272. Up to 3 conditions per place. [2025-01-09 21:32:04,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 336 places, 329 transitions, 724 flow [2025-01-09 21:32:04,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 298 transitions, 641 flow [2025-01-09 21:32:04,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:04,519 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;@b8ba431, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:04,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-09 21:32:04,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:04,526 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2025-01-09 21:32:04,526 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:04,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:04,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:04,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:04,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:04,530 INFO L85 PathProgramCache]: Analyzing trace with hash -555351477, now seen corresponding path program 1 times [2025-01-09 21:32:04,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:04,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519516348] [2025-01-09 21:32:04,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:04,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:32:04,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:32:04,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:04,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:04,695 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:04,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:04,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519516348] [2025-01-09 21:32:04,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519516348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852750520] [2025-01-09 21:32:04,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:04,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:04,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:04,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:04,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 333 [2025-01-09 21:32:04,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 298 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call 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:04,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:04,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 333 [2025-01-09 21:32:04,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:04,973 INFO L124 PetriNetUnfolderBase]: 128/1152 cut-off events. [2025-01-09 21:32:04,973 INFO L125 PetriNetUnfolderBase]: For 198/209 co-relation queries the response was YES. [2025-01-09 21:32:04,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 1152 events. 128/1152 cut-off events. For 198/209 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7125 event pairs, 88 based on Foata normal form. 104/1085 useless extension candidates. Maximal degree in co-relation 1465. Up to 215 conditions per place. [2025-01-09 21:32:04,985 INFO L140 encePairwiseOnDemand]: 323/333 looper letters, 22 selfloop transitions, 2 changer transitions 1/290 dead transitions. [2025-01-09 21:32:04,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 290 transitions, 673 flow [2025-01-09 21:32:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2025-01-09 21:32:04,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8998998998998999 [2025-01-09 21:32:04,997 INFO L175 Difference]: Start difference. First operand has 306 places, 298 transitions, 641 flow. Second operand 3 states and 899 transitions. [2025-01-09 21:32:04,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 290 transitions, 673 flow [2025-01-09 21:32:05,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 290 transitions, 644 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-01-09 21:32:05,005 INFO L231 Difference]: Finished difference. Result has 296 places, 289 transitions, 598 flow [2025-01-09 21:32:05,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=296, PETRI_TRANSITIONS=289} [2025-01-09 21:32:05,008 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -10 predicate places. [2025-01-09 21:32:05,009 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 289 transitions, 598 flow [2025-01-09 21:32:05,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call 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:05,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:05,009 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] [2025-01-09 21:32:05,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:05,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:05,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash -23279243, now seen corresponding path program 1 times [2025-01-09 21:32:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:05,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918845302] [2025-01-09 21:32:05,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:05,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:32:05,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:32:05,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:05,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:05,056 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:05,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:05,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918845302] [2025-01-09 21:32:05,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918845302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:05,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:05,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:05,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605671552] [2025-01-09 21:32:05,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:05,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:05,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:05,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:05,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:05,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 333 [2025-01-09 21:32:05,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 289 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call 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:05,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:05,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 333 [2025-01-09 21:32:05,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:05,260 INFO L124 PetriNetUnfolderBase]: 152/1260 cut-off events. [2025-01-09 21:32:05,260 INFO L125 PetriNetUnfolderBase]: For 61/77 co-relation queries the response was YES. [2025-01-09 21:32:05,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1260 events. 152/1260 cut-off events. For 61/77 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7958 event pairs, 88 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 1519. Up to 239 conditions per place. [2025-01-09 21:32:05,271 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 22 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-01-09 21:32:05,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 288 transitions, 644 flow [2025-01-09 21:32:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-01-09 21:32:05,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928928928928929 [2025-01-09 21:32:05,273 INFO L175 Difference]: Start difference. First operand has 296 places, 289 transitions, 598 flow. Second operand 3 states and 892 transitions. [2025-01-09 21:32:05,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 288 transitions, 644 flow [2025-01-09 21:32:05,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 288 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:05,277 INFO L231 Difference]: Finished difference. Result has 294 places, 288 transitions, 596 flow [2025-01-09 21:32:05,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=294, PETRI_TRANSITIONS=288} [2025-01-09 21:32:05,278 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2025-01-09 21:32:05,278 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 288 transitions, 596 flow [2025-01-09 21:32:05,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call 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:05,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:05,279 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] [2025-01-09 21:32:05,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:05,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:05,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:05,280 INFO L85 PathProgramCache]: Analyzing trace with hash 793117596, now seen corresponding path program 1 times [2025-01-09 21:32:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:05,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580884028] [2025-01-09 21:32:05,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:05,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 21:32:05,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:32:05,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:05,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:05,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580884028] [2025-01-09 21:32:05,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580884028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:05,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:05,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285407539] [2025-01-09 21:32:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:05,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:05,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:05,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:05,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 333 [2025-01-09 21:32:05,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 288 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call 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:05,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:05,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 333 [2025-01-09 21:32:05,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:05,504 INFO L124 PetriNetUnfolderBase]: 128/927 cut-off events. [2025-01-09 21:32:05,504 INFO L125 PetriNetUnfolderBase]: For 47/53 co-relation queries the response was YES. [2025-01-09 21:32:05,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 927 events. 128/927 cut-off events. For 47/53 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5267 event pairs, 88 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 1162. Up to 215 conditions per place. [2025-01-09 21:32:05,513 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 22 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-01-09 21:32:05,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 287 transitions, 642 flow [2025-01-09 21:32:05,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-01-09 21:32:05,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928928928928929 [2025-01-09 21:32:05,516 INFO L175 Difference]: Start difference. First operand has 294 places, 288 transitions, 596 flow. Second operand 3 states and 892 transitions. [2025-01-09 21:32:05,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 287 transitions, 642 flow [2025-01-09 21:32:05,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 287 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:05,520 INFO L231 Difference]: Finished difference. Result has 293 places, 287 transitions, 594 flow [2025-01-09 21:32:05,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=293, PETRI_TRANSITIONS=287} [2025-01-09 21:32:05,521 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -13 predicate places. [2025-01-09 21:32:05,521 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 287 transitions, 594 flow [2025-01-09 21:32:05,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call 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:05,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:05,521 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] [2025-01-09 21:32:05,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:05,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:05,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:05,522 INFO L85 PathProgramCache]: Analyzing trace with hash -504514342, now seen corresponding path program 1 times [2025-01-09 21:32:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:05,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51265909] [2025-01-09 21:32:05,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:05,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:05,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:32:05,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:32:05,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:05,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:05,594 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:05,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:05,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51265909] [2025-01-09 21:32:05,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51265909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:05,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:05,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:05,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198318171] [2025-01-09 21:32:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:05,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:05,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:05,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:05,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 333 [2025-01-09 21:32:05,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 287 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call 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:05,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:05,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 333 [2025-01-09 21:32:05,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:05,763 INFO L124 PetriNetUnfolderBase]: 152/950 cut-off events. [2025-01-09 21:32:05,763 INFO L125 PetriNetUnfolderBase]: For 76/86 co-relation queries the response was YES. [2025-01-09 21:32:05,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 950 events. 152/950 cut-off events. For 76/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5107 event pairs, 88 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 1161. Up to 239 conditions per place. [2025-01-09 21:32:05,772 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 22 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2025-01-09 21:32:05,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 286 transitions, 640 flow [2025-01-09 21:32:05,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-01-09 21:32:05,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928928928928929 [2025-01-09 21:32:05,775 INFO L175 Difference]: Start difference. First operand has 293 places, 287 transitions, 594 flow. Second operand 3 states and 892 transitions. [2025-01-09 21:32:05,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 286 transitions, 640 flow [2025-01-09 21:32:05,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 286 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:05,778 INFO L231 Difference]: Finished difference. Result has 292 places, 286 transitions, 592 flow [2025-01-09 21:32:05,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=292, PETRI_TRANSITIONS=286} [2025-01-09 21:32:05,779 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -14 predicate places. [2025-01-09 21:32:05,779 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 286 transitions, 592 flow [2025-01-09 21:32:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call 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:05,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:05,780 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] [2025-01-09 21:32:05,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:05,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:05,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash -791440260, now seen corresponding path program 1 times [2025-01-09 21:32:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:05,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390628368] [2025-01-09 21:32:05,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:05,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:05,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:32:05,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:32:05,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:05,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:05,870 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:05,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:05,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390628368] [2025-01-09 21:32:05,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390628368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:05,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:05,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668214146] [2025-01-09 21:32:05,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:05,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:05,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:05,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:05,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:05,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:05,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 286 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call 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:05,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:05,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:05,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:06,069 INFO L124 PetriNetUnfolderBase]: 188/1432 cut-off events. [2025-01-09 21:32:06,070 INFO L125 PetriNetUnfolderBase]: For 53/101 co-relation queries the response was YES. [2025-01-09 21:32:06,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 1432 events. 188/1432 cut-off events. For 53/101 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9469 event pairs, 86 based on Foata normal form. 6/1208 useless extension candidates. Maximal degree in co-relation 1785. Up to 245 conditions per place. [2025-01-09 21:32:06,087 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 29 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-01-09 21:32:06,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 293 transitions, 677 flow [2025-01-09 21:32:06,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:32:06,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2025-01-09 21:32:06,089 INFO L175 Difference]: Start difference. First operand has 292 places, 286 transitions, 592 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:32:06,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 293 transitions, 677 flow [2025-01-09 21:32:06,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:06,093 INFO L231 Difference]: Finished difference. Result has 291 places, 285 transitions, 590 flow [2025-01-09 21:32:06,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=291, PETRI_TRANSITIONS=285} [2025-01-09 21:32:06,094 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -15 predicate places. [2025-01-09 21:32:06,094 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 285 transitions, 590 flow [2025-01-09 21:32:06,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call 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:06,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:06,095 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:06,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:06,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:06,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1574384374, now seen corresponding path program 1 times [2025-01-09 21:32:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:06,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103941061] [2025-01-09 21:32:06,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:06,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:06,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 21:32:06,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 21:32:06,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:06,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,146 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:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103941061] [2025-01-09 21:32:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103941061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387415500] [2025-01-09 21:32:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:06,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 285 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call 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:06,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:06,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:06,271 INFO L124 PetriNetUnfolderBase]: 168/1075 cut-off events. [2025-01-09 21:32:06,271 INFO L125 PetriNetUnfolderBase]: For 54/69 co-relation queries the response was YES. [2025-01-09 21:32:06,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 1075 events. 168/1075 cut-off events. For 54/69 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6514 event pairs, 42 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 560. Up to 177 conditions per place. [2025-01-09 21:32:06,279 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 27 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2025-01-09 21:32:06,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 291 transitions, 671 flow [2025-01-09 21:32:06,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:32:06,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2025-01-09 21:32:06,281 INFO L175 Difference]: Start difference. First operand has 291 places, 285 transitions, 590 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:32:06,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 291 transitions, 671 flow [2025-01-09 21:32:06,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 291 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:06,284 INFO L231 Difference]: Finished difference. Result has 289 places, 283 transitions, 588 flow [2025-01-09 21:32:06,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=289, PETRI_TRANSITIONS=283} [2025-01-09 21:32:06,284 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -17 predicate places. [2025-01-09 21:32:06,285 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 588 flow [2025-01-09 21:32:06,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call 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:06,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:06,285 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] [2025-01-09 21:32:06,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:06,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:06,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash 585683060, now seen corresponding path program 1 times [2025-01-09 21:32:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355475097] [2025-01-09 21:32:06,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:06,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:32:06,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:32:06,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,327 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:06,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355475097] [2025-01-09 21:32:06,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355475097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593200000] [2025-01-09 21:32:06,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:06,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 283 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call 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:06,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:06,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:06,480 INFO L124 PetriNetUnfolderBase]: 188/1215 cut-off events. [2025-01-09 21:32:06,480 INFO L125 PetriNetUnfolderBase]: For 70/113 co-relation queries the response was YES. [2025-01-09 21:32:06,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1634 conditions, 1215 events. 188/1215 cut-off events. For 70/113 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7441 event pairs, 86 based on Foata normal form. 6/1039 useless extension candidates. Maximal degree in co-relation 1232. Up to 245 conditions per place. [2025-01-09 21:32:06,489 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 29 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-01-09 21:32:06,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 290 transitions, 672 flow [2025-01-09 21:32:06,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:32:06,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2025-01-09 21:32:06,491 INFO L175 Difference]: Start difference. First operand has 289 places, 283 transitions, 588 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:32:06,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 290 transitions, 672 flow [2025-01-09 21:32:06,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 290 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:06,494 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 584 flow [2025-01-09 21:32:06,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2025-01-09 21:32:06,495 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -18 predicate places. [2025-01-09 21:32:06,495 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 584 flow [2025-01-09 21:32:06,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call 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:06,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:06,495 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] [2025-01-09 21:32:06,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:06,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2141630952, now seen corresponding path program 1 times [2025-01-09 21:32:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:06,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208112992] [2025-01-09 21:32:06,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:06,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:32:06,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:32:06,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:06,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208112992] [2025-01-09 21:32:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208112992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223930966] [2025-01-09 21:32:06,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:06,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call 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:06,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:06,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:06,675 INFO L124 PetriNetUnfolderBase]: 230/1189 cut-off events. [2025-01-09 21:32:06,675 INFO L125 PetriNetUnfolderBase]: For 94/110 co-relation queries the response was YES. [2025-01-09 21:32:06,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 1189 events. 230/1189 cut-off events. For 94/110 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7384 event pairs, 86 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1093. Up to 275 conditions per place. [2025-01-09 21:32:06,685 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 30 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-01-09 21:32:06,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 290 transitions, 674 flow [2025-01-09 21:32:06,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2025-01-09 21:32:06,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2025-01-09 21:32:06,687 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 584 flow. Second operand 3 states and 906 transitions. [2025-01-09 21:32:06,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 290 transitions, 674 flow [2025-01-09 21:32:06,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 290 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:06,690 INFO L231 Difference]: Finished difference. Result has 287 places, 281 transitions, 582 flow [2025-01-09 21:32:06,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=287, PETRI_TRANSITIONS=281} [2025-01-09 21:32:06,691 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -19 predicate places. [2025-01-09 21:32:06,691 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 281 transitions, 582 flow [2025-01-09 21:32:06,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call 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:06,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:06,692 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] [2025-01-09 21:32:06,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:06,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:06,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1927689465, now seen corresponding path program 1 times [2025-01-09 21:32:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483949785] [2025-01-09 21:32:06,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:06,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:06,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:32:06,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:32:06,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:06,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,732 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:06,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483949785] [2025-01-09 21:32:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483949785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576321089] [2025-01-09 21:32:06,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:06,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 281 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call 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:06,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:06,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:06,851 INFO L124 PetriNetUnfolderBase]: 168/966 cut-off events. [2025-01-09 21:32:06,851 INFO L125 PetriNetUnfolderBase]: For 58/64 co-relation queries the response was YES. [2025-01-09 21:32:06,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 966 events. 168/966 cut-off events. For 58/64 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5495 event pairs, 46 based on Foata normal form. 1/850 useless extension candidates. Maximal degree in co-relation 960. Up to 166 conditions per place. [2025-01-09 21:32:06,856 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 27 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2025-01-09 21:32:06,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 287 transitions, 662 flow [2025-01-09 21:32:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:32:06,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2025-01-09 21:32:06,858 INFO L175 Difference]: Start difference. First operand has 287 places, 281 transitions, 582 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:32:06,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 287 transitions, 662 flow [2025-01-09 21:32:06,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 287 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:06,861 INFO L231 Difference]: Finished difference. Result has 285 places, 279 transitions, 580 flow [2025-01-09 21:32:06,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=285, PETRI_TRANSITIONS=279} [2025-01-09 21:32:06,862 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -21 predicate places. [2025-01-09 21:32:06,862 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 279 transitions, 580 flow [2025-01-09 21:32:06,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call 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:06,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:06,863 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] [2025-01-09 21:32:06,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:06,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:06,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash -410744278, now seen corresponding path program 1 times [2025-01-09 21:32:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:06,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198389864] [2025-01-09 21:32:06,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:06,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:32:06,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:32:06,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:06,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,902 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:06,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198389864] [2025-01-09 21:32:06,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198389864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999378846] [2025-01-09 21:32:06,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:06,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 279 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call 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:06,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:06,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:07,029 INFO L124 PetriNetUnfolderBase]: 204/1211 cut-off events. [2025-01-09 21:32:07,029 INFO L125 PetriNetUnfolderBase]: For 82/102 co-relation queries the response was YES. [2025-01-09 21:32:07,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 1211 events. 204/1211 cut-off events. For 82/102 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7378 event pairs, 59 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1124. Up to 182 conditions per place. [2025-01-09 21:32:07,037 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 28 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2025-01-09 21:32:07,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 286 transitions, 666 flow [2025-01-09 21:32:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2025-01-09 21:32:07,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2025-01-09 21:32:07,039 INFO L175 Difference]: Start difference. First operand has 285 places, 279 transitions, 580 flow. Second operand 3 states and 906 transitions. [2025-01-09 21:32:07,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 286 transitions, 666 flow [2025-01-09 21:32:07,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 286 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:07,042 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 576 flow [2025-01-09 21:32:07,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2025-01-09 21:32:07,043 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -23 predicate places. [2025-01-09 21:32:07,043 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 576 flow [2025-01-09 21:32:07,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call 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:07,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:07,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:07,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:07,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2001891337, now seen corresponding path program 1 times [2025-01-09 21:32:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:07,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-01-09 21:32:07,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:07,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:07,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 21:32:07,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 21:32:07,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:07,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:07,085 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:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-01-09 21:32:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399393467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:07,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:07,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:07,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091017070] [2025-01-09 21:32:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:07,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:07,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:07,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:07,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call 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:07,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:07,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:07,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:07,225 INFO L124 PetriNetUnfolderBase]: 230/1008 cut-off events. [2025-01-09 21:32:07,225 INFO L125 PetriNetUnfolderBase]: For 112/122 co-relation queries the response was YES. [2025-01-09 21:32:07,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 1008 events. 230/1008 cut-off events. For 112/122 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5531 event pairs, 104 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1039. Up to 275 conditions per place. [2025-01-09 21:32:07,230 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 30 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-01-09 21:32:07,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 285 transitions, 665 flow [2025-01-09 21:32:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2025-01-09 21:32:07,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2025-01-09 21:32:07,232 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 576 flow. Second operand 3 states and 906 transitions. [2025-01-09 21:32:07,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 285 transitions, 665 flow [2025-01-09 21:32:07,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 285 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:07,235 INFO L231 Difference]: Finished difference. Result has 282 places, 276 transitions, 572 flow [2025-01-09 21:32:07,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=282, PETRI_TRANSITIONS=276} [2025-01-09 21:32:07,236 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -24 predicate places. [2025-01-09 21:32:07,236 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 276 transitions, 572 flow [2025-01-09 21:32:07,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call 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:07,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:07,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:07,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:07,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread6Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:07,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1571888822, now seen corresponding path program 1 times [2025-01-09 21:32:07,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:07,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419327246] [2025-01-09 21:32:07,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:07,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:07,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:32:07,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:32:07,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:07,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:07,275 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:07,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:07,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419327246] [2025-01-09 21:32:07,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419327246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:07,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:07,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353832246] [2025-01-09 21:32:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:07,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:07,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:07,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:07,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:07,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:07,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 276 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call 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:07,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:07,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:07,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:07,443 INFO L124 PetriNetUnfolderBase]: 204/985 cut-off events. [2025-01-09 21:32:07,443 INFO L125 PetriNetUnfolderBase]: For 112/122 co-relation queries the response was YES. [2025-01-09 21:32:07,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 985 events. 204/985 cut-off events. For 112/122 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5382 event pairs, 51 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 606. Up to 171 conditions per place. [2025-01-09 21:32:07,450 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 28 selfloop transitions, 3 changer transitions 0/283 dead transitions. [2025-01-09 21:32:07,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 283 transitions, 657 flow [2025-01-09 21:32:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2025-01-09 21:32:07,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2025-01-09 21:32:07,454 INFO L175 Difference]: Start difference. First operand has 282 places, 276 transitions, 572 flow. Second operand 3 states and 906 transitions. [2025-01-09 21:32:07,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 283 transitions, 657 flow [2025-01-09 21:32:07,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 283 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:07,458 INFO L231 Difference]: Finished difference. Result has 280 places, 274 transitions, 570 flow [2025-01-09 21:32:07,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=280, PETRI_TRANSITIONS=274} [2025-01-09 21:32:07,459 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -26 predicate places. [2025-01-09 21:32:07,460 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 274 transitions, 570 flow [2025-01-09 21:32:07,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call 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:07,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:07,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:07,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:07,461 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:07,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:07,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1394444034, now seen corresponding path program 1 times [2025-01-09 21:32:07,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:07,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673914995] [2025-01-09 21:32:07,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:07,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:07,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:32:07,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:32:07,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:07,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:07,507 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:07,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673914995] [2025-01-09 21:32:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673914995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:07,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:07,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:07,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976882609] [2025-01-09 21:32:07,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:07,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:07,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:07,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:07,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:07,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:07,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 274 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call 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:07,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:07,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:07,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:07,639 INFO L124 PetriNetUnfolderBase]: 188/1090 cut-off events. [2025-01-09 21:32:07,640 INFO L125 PetriNetUnfolderBase]: For 45/62 co-relation queries the response was YES. [2025-01-09 21:32:07,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 1090 events. 188/1090 cut-off events. For 45/62 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6549 event pairs, 104 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1219. Up to 245 conditions per place. [2025-01-09 21:32:07,647 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 29 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-01-09 21:32:07,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 281 transitions, 655 flow [2025-01-09 21:32:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:32:07,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2025-01-09 21:32:07,649 INFO L175 Difference]: Start difference. First operand has 280 places, 274 transitions, 570 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:32:07,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 281 transitions, 655 flow [2025-01-09 21:32:07,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 281 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:07,652 INFO L231 Difference]: Finished difference. Result has 279 places, 273 transitions, 566 flow [2025-01-09 21:32:07,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=279, PETRI_TRANSITIONS=273} [2025-01-09 21:32:07,653 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -27 predicate places. [2025-01-09 21:32:07,653 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 273 transitions, 566 flow [2025-01-09 21:32:07,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call 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:07,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:07,654 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] [2025-01-09 21:32:07,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:07,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread5Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:07,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash 71281345, now seen corresponding path program 1 times [2025-01-09 21:32:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:07,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556513232] [2025-01-09 21:32:07,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:07,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 21:32:07,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 21:32:07,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:07,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:07,692 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:07,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:07,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556513232] [2025-01-09 21:32:07,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556513232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:07,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:07,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244784096] [2025-01-09 21:32:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:07,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:07,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:07,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:07,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:07,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:07,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 273 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call 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:07,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:07,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:07,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:07,830 INFO L124 PetriNetUnfolderBase]: 188/930 cut-off events. [2025-01-09 21:32:07,831 INFO L125 PetriNetUnfolderBase]: For 65/71 co-relation queries the response was YES. [2025-01-09 21:32:07,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 930 events. 188/930 cut-off events. For 65/71 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5205 event pairs, 104 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 992. Up to 245 conditions per place. [2025-01-09 21:32:07,835 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 29 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-01-09 21:32:07,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 280 transitions, 650 flow [2025-01-09 21:32:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:32:07,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2025-01-09 21:32:07,837 INFO L175 Difference]: Start difference. First operand has 279 places, 273 transitions, 566 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:32:07,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 280 transitions, 650 flow [2025-01-09 21:32:07,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 280 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:07,840 INFO L231 Difference]: Finished difference. Result has 278 places, 272 transitions, 564 flow [2025-01-09 21:32:07,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=278, PETRI_TRANSITIONS=272} [2025-01-09 21:32:07,841 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -28 predicate places. [2025-01-09 21:32:07,841 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 272 transitions, 564 flow [2025-01-09 21:32:07,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call 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:07,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:07,842 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] [2025-01-09 21:32:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:07,842 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1966884302, now seen corresponding path program 1 times [2025-01-09 21:32:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:07,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252174528] [2025-01-09 21:32:07,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:07,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 21:32:07,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 21:32:07,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:07,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:07,886 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:07,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:07,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252174528] [2025-01-09 21:32:07,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252174528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:07,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:07,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:07,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598663151] [2025-01-09 21:32:07,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:07,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:07,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:07,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:07,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:07,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:07,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 272 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call 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:07,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:07,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:07,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:08,014 INFO L124 PetriNetUnfolderBase]: 230/1204 cut-off events. [2025-01-09 21:32:08,014 INFO L125 PetriNetUnfolderBase]: For 92/114 co-relation queries the response was YES. [2025-01-09 21:32:08,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 1204 events. 230/1204 cut-off events. For 92/114 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7644 event pairs, 104 based on Foata normal form. 0/1049 useless extension candidates. Maximal degree in co-relation 1225. Up to 275 conditions per place. [2025-01-09 21:32:08,021 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 26 selfloop transitions, 2 changer transitions 6/280 dead transitions. [2025-01-09 21:32:08,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 654 flow [2025-01-09 21:32:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2025-01-09 21:32:08,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2025-01-09 21:32:08,024 INFO L175 Difference]: Start difference. First operand has 278 places, 272 transitions, 564 flow. Second operand 3 states and 906 transitions. [2025-01-09 21:32:08,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 654 flow [2025-01-09 21:32:08,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 280 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:08,027 INFO L231 Difference]: Finished difference. Result has 277 places, 267 transitions, 552 flow [2025-01-09 21:32:08,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=277, PETRI_TRANSITIONS=267} [2025-01-09 21:32:08,028 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -29 predicate places. [2025-01-09 21:32:08,028 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 267 transitions, 552 flow [2025-01-09 21:32:08,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call 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:08,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:08,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:08,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:32:08,029 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread6Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:32:08,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:08,029 INFO L85 PathProgramCache]: Analyzing trace with hash -577636098, now seen corresponding path program 1 times [2025-01-09 21:32:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:08,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820207181] [2025-01-09 21:32:08,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:08,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:08,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:32:08,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:32:08,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:08,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:08,074 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:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820207181] [2025-01-09 21:32:08,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820207181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:08,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:08,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488456164] [2025-01-09 21:32:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:08,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:08,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:08,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:08,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:08,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2025-01-09 21:32:08,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 267 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call 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:08,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:08,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2025-01-09 21:32:08,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:08,182 INFO L124 PetriNetUnfolderBase]: 217/937 cut-off events. [2025-01-09 21:32:08,182 INFO L125 PetriNetUnfolderBase]: For 103/113 co-relation queries the response was YES. [2025-01-09 21:32:08,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 937 events. 217/937 cut-off events. For 103/113 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5124 event pairs, 99 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 985. Up to 256 conditions per place. [2025-01-09 21:32:08,187 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 0 selfloop transitions, 0 changer transitions 275/275 dead transitions. [2025-01-09 21:32:08,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 275 transitions, 637 flow [2025-01-09 21:32:08,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-01-09 21:32:08,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9049049049049049 [2025-01-09 21:32:08,189 INFO L175 Difference]: Start difference. First operand has 277 places, 267 transitions, 552 flow. Second operand 3 states and 904 transitions. [2025-01-09 21:32:08,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 275 transitions, 637 flow [2025-01-09 21:32:08,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:08,191 INFO L231 Difference]: Finished difference. Result has 273 places, 0 transitions, 0 flow [2025-01-09 21:32:08,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=273, PETRI_TRANSITIONS=0} [2025-01-09 21:32:08,192 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -33 predicate places. [2025-01-09 21:32:08,192 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 0 transitions, 0 flow [2025-01-09 21:32:08,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call 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:08,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 46 remaining) [2025-01-09 21:32:08,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-01-09 21:32:08,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-01-09 21:32:08,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-01-09 21:32:08,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:32:08,202 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:08,207 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:08,209 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:08,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:08 BasicIcfg [2025-01-09 21:32:08,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:08,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:08,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:08,214 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:08,214 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:04" (3/4) ... [2025-01-09 21:32:08,215 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:08,217 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:08,217 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:08,217 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:08,218 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:32:08,218 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-01-09 21:32:08,218 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-01-09 21:32:08,221 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 21:32:08,221 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:08,222 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:32:08,222 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:08,279 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:08,279 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:08,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:08,280 INFO L158 Benchmark]: Toolchain (without parser) took 4607.78ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 105.5MB in the beginning and 181.3MB in the end (delta: -75.8MB). Peak memory consumption was 200.1MB. Max. memory is 16.1GB. [2025-01-09 21:32:08,280 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:08,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.74ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.5MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:08,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.90ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.3MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:08,281 INFO L158 Benchmark]: Boogie Preprocessor took 18.49ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 89.4MB in the end (delta: 858.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:08,281 INFO L158 Benchmark]: RCFGBuilder took 342.93ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 67.0MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:08,281 INFO L158 Benchmark]: TraceAbstraction took 3939.50ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 66.0MB in the beginning and 189.7MB in the end (delta: -123.7MB). Peak memory consumption was 149.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:08,281 INFO L158 Benchmark]: Witness Printer took 65.41ms. Allocated memory is still 419.4MB. Free memory was 189.7MB in the beginning and 181.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:08,282 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 140.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.74ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.5MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.90ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.3MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.49ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 89.4MB in the end (delta: 858.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 342.93ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 67.0MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3939.50ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 66.0MB in the beginning and 189.7MB in the end (delta: -123.7MB). Peak memory consumption was 149.8MB. Max. memory is 16.1GB. * Witness Printer took 65.41ms. Allocated memory is still 419.4MB. Free memory was 189.7MB in the beginning and 181.3MB 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: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: 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: 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: 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: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 502 locations, 46 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: 3.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 964 IncrementalHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 92 mSDtfsCounter, 964 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1784 NumberOfCodeBlocks, 1784 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 1800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:08,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE