./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive.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/popl20-send-receive.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 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:53,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:54,005 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:33:54,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:54,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:54,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:54,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:54,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:54,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:54,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:54,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:54,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:54,057 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:54,059 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:54,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:54,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:54,062 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:54,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:54,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:54,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:54,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:54,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:54,064 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 -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2025-01-09 21:33:54,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:54,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:54,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:54,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:54,532 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:54,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-01-09 21:33:55,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbb38bdf7/93b7bd4bcc8040c78125df117f2a88ae/FLAG9b9688747 [2025-01-09 21:33:56,021 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:56,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-01-09 21:33:56,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbb38bdf7/93b7bd4bcc8040c78125df117f2a88ae/FLAG9b9688747 [2025-01-09 21:33:56,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbb38bdf7/93b7bd4bcc8040c78125df117f2a88ae [2025-01-09 21:33:56,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:56,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:56,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:56,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:56,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:56,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2413c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56, skipping insertion in model container [2025-01-09 21:33:56,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:56,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:56,198 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:56,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:56,247 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:56,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56 WrapperNode [2025-01-09 21:33:56,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:56,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:56,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:56,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:56,255 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:33:56" (1/1) ... [2025-01-09 21:33:56,262 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:33:56" (1/1) ... [2025-01-09 21:33:56,277 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 259 [2025-01-09 21:33:56,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:56,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:56,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:56,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:56,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,290 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:56,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:56,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:56,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:56,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:56,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:56,331 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:33:56,336 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:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:56,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:56,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:56,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:56,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:56,351 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:33:56,522 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:56,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:56,831 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:56,831 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:57,111 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:57,113 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:33:57,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:57 BoogieIcfgContainer [2025-01-09 21:33:57,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:57,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:57,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:57,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:57,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:56" (1/3) ... [2025-01-09 21:33:57,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cabf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:57, skipping insertion in model container [2025-01-09 21:33:57,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (2/3) ... [2025-01-09 21:33:57,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cabf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:57, skipping insertion in model container [2025-01-09 21:33:57,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:57" (3/3) ... [2025-01-09 21:33:57,121 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2025-01-09 21:33:57,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:57,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 207 locations, 1 initial locations, 3 loop locations, and 40 error locations. [2025-01-09 21:33:57,134 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:57,202 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:57,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 214 transitions, 449 flow [2025-01-09 21:33:57,332 INFO L124 PetriNetUnfolderBase]: 8/211 cut-off events. [2025-01-09 21:33:57,333 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:57,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 211 events. 8/211 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 335 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 194. Up to 2 conditions per place. [2025-01-09 21:33:57,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 214 transitions, 449 flow [2025-01-09 21:33:57,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 202 transitions, 419 flow [2025-01-09 21:33:57,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:57,380 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;@273b4b19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:57,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-01-09 21:33:57,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:57,391 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:33:57,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:57,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:57,392 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] [2025-01-09 21:33:57,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-01-09 21:33:57,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1534691975, now seen corresponding path program 1 times [2025-01-09 21:33:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:57,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54890127] [2025-01-09 21:33:57,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:57,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:57,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:33:57,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:33:57,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:57,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:57,554 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:33:57,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:57,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54890127] [2025-01-09 21:33:57,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54890127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:57,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:57,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289390561] [2025-01-09 21:33:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:57,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:57,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:57,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:57,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:57,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 214 [2025-01-09 21:33:57,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 202 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:57,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:57,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 214 [2025-01-09 21:33:57,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:57,789 INFO L124 PetriNetUnfolderBase]: 98/532 cut-off events. [2025-01-09 21:33:57,790 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-09 21:33:57,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 532 events. 98/532 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2484 event pairs, 53 based on Foata normal form. 11/450 useless extension candidates. Maximal degree in co-relation 566. Up to 142 conditions per place. [2025-01-09 21:33:57,796 INFO L140 encePairwiseOnDemand]: 179/214 looper letters, 17 selfloop transitions, 2 changer transitions 3/169 dead transitions. [2025-01-09 21:33:57,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 169 transitions, 393 flow [2025-01-09 21:33:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-01-09 21:33:57,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8208722741433022 [2025-01-09 21:33:57,812 INFO L175 Difference]: Start difference. First operand has 204 places, 202 transitions, 419 flow. Second operand 3 states and 527 transitions. [2025-01-09 21:33:57,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 169 transitions, 393 flow [2025-01-09 21:33:57,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 169 transitions, 384 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:57,823 INFO L231 Difference]: Finished difference. Result has 171 places, 166 transitions, 341 flow [2025-01-09 21:33:57,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=171, PETRI_TRANSITIONS=166} [2025-01-09 21:33:57,827 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -33 predicate places. [2025-01-09 21:33:57,829 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 166 transitions, 341 flow [2025-01-09 21:33:57,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:57,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:57,829 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] [2025-01-09 21:33:57,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:57,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-01-09 21:33:57,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1703925445, now seen corresponding path program 1 times [2025-01-09 21:33:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680349600] [2025-01-09 21:33:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:57,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:33:57,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:33:57,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:57,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:57,891 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:33:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:57,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680349600] [2025-01-09 21:33:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680349600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:57,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061018942] [2025-01-09 21:33:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:57,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:57,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:57,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:57,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 214 [2025-01-09 21:33:57,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 166 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:57,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:57,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 214 [2025-01-09 21:33:57,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:57,986 INFO L124 PetriNetUnfolderBase]: 79/502 cut-off events. [2025-01-09 21:33:57,986 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:33:57,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 502 events. 79/502 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2245 event pairs, 37 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 609. Up to 110 conditions per place. [2025-01-09 21:33:57,990 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 16 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2025-01-09 21:33:57,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 165 transitions, 375 flow [2025-01-09 21:33:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-01-09 21:33:57,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7725856697819314 [2025-01-09 21:33:57,992 INFO L175 Difference]: Start difference. First operand has 171 places, 166 transitions, 341 flow. Second operand 3 states and 496 transitions. [2025-01-09 21:33:57,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 165 transitions, 375 flow [2025-01-09 21:33:57,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 165 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:57,995 INFO L231 Difference]: Finished difference. Result has 167 places, 165 transitions, 339 flow [2025-01-09 21:33:57,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=167, PETRI_TRANSITIONS=165} [2025-01-09 21:33:57,996 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -37 predicate places. [2025-01-09 21:33:57,996 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 165 transitions, 339 flow [2025-01-09 21:33:57,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:57,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:57,997 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] [2025-01-09 21:33:57,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:57,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-01-09 21:33:57,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:57,999 INFO L85 PathProgramCache]: Analyzing trace with hash 685443854, now seen corresponding path program 1 times [2025-01-09 21:33:57,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:57,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735725981] [2025-01-09 21:33:57,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:33:58,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:33:58,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,046 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:33:58,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735725981] [2025-01-09 21:33:58,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735725981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119765726] [2025-01-09 21:33:58,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:58,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:58,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:58,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:58,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:58,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 214 [2025-01-09 21:33:58,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 165 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:58,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 214 [2025-01-09 21:33:58,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:58,205 INFO L124 PetriNetUnfolderBase]: 114/723 cut-off events. [2025-01-09 21:33:58,205 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:33:58,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 723 events. 114/723 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4067 event pairs, 48 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 872. Up to 87 conditions per place. [2025-01-09 21:33:58,209 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 22 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2025-01-09 21:33:58,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 173 transitions, 407 flow [2025-01-09 21:33:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-01-09 21:33:58,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8006230529595015 [2025-01-09 21:33:58,211 INFO L175 Difference]: Start difference. First operand has 167 places, 165 transitions, 339 flow. Second operand 3 states and 514 transitions. [2025-01-09 21:33:58,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 173 transitions, 407 flow [2025-01-09 21:33:58,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 173 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:58,214 INFO L231 Difference]: Finished difference. Result has 167 places, 165 transitions, 343 flow [2025-01-09 21:33:58,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=167, PETRI_TRANSITIONS=165} [2025-01-09 21:33:58,215 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -37 predicate places. [2025-01-09 21:33:58,215 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 165 transitions, 343 flow [2025-01-09 21:33:58,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:58,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:58,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:58,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-01-09 21:33:58,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash -529148137, now seen corresponding path program 1 times [2025-01-09 21:33:58,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:58,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123006907] [2025-01-09 21:33:58,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:33:58,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:33:58,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,238 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:33:58,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123006907] [2025-01-09 21:33:58,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123006907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:58,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369406882] [2025-01-09 21:33:58,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:58,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:58,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:58,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:58,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:58,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 214 [2025-01-09 21:33:58,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 165 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:58,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 214 [2025-01-09 21:33:58,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:58,434 INFO L124 PetriNetUnfolderBase]: 165/756 cut-off events. [2025-01-09 21:33:58,434 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-01-09 21:33:58,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 756 events. 165/756 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4330 event pairs, 103 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 690. Up to 239 conditions per place. [2025-01-09 21:33:58,437 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 18 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-01-09 21:33:58,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 381 flow [2025-01-09 21:33:58,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-01-09 21:33:58,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7694704049844237 [2025-01-09 21:33:58,441 INFO L175 Difference]: Start difference. First operand has 167 places, 165 transitions, 343 flow. Second operand 3 states and 494 transitions. [2025-01-09 21:33:58,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 381 flow [2025-01-09 21:33:58,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:58,445 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 343 flow [2025-01-09 21:33:58,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2025-01-09 21:33:58,446 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -37 predicate places. [2025-01-09 21:33:58,446 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 343 flow [2025-01-09 21:33:58,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:58,446 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] [2025-01-09 21:33:58,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:58,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-01-09 21:33:58,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:58,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1366522177, now seen corresponding path program 1 times [2025-01-09 21:33:58,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:58,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539143129] [2025-01-09 21:33:58,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:58,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:33:58,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:33:58,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,494 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:33:58,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539143129] [2025-01-09 21:33:58,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539143129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:58,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701701221] [2025-01-09 21:33:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:58,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:58,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:58,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:58,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:58,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 214 [2025-01-09 21:33:58,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:58,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 214 [2025-01-09 21:33:58,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:58,585 INFO L124 PetriNetUnfolderBase]: 113/681 cut-off events. [2025-01-09 21:33:58,586 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-09 21:33:58,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 681 events. 113/681 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3735 event pairs, 57 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 845. Up to 155 conditions per place. [2025-01-09 21:33:58,591 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 16 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-01-09 21:33:58,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 377 flow [2025-01-09 21:33:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-01-09 21:33:58,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7757009345794392 [2025-01-09 21:33:58,595 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 343 flow. Second operand 3 states and 498 transitions. [2025-01-09 21:33:58,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 377 flow [2025-01-09 21:33:58,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 163 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:58,598 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 341 flow [2025-01-09 21:33:58,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2025-01-09 21:33:58,599 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -38 predicate places. [2025-01-09 21:33:58,601 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 341 flow [2025-01-09 21:33:58,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:58,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:58,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:58,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-01-09 21:33:58,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1932054395, now seen corresponding path program 1 times [2025-01-09 21:33:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655437862] [2025-01-09 21:33:58,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:33:58,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:33:58,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,669 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:33:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655437862] [2025-01-09 21:33:58,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655437862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:58,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489187512] [2025-01-09 21:33:58,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:58,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:58,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:58,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:58,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:58,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 214 [2025-01-09 21:33:58,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:58,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 214 [2025-01-09 21:33:58,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:58,803 INFO L124 PetriNetUnfolderBase]: 171/772 cut-off events. [2025-01-09 21:33:58,803 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-09 21:33:58,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 772 events. 171/772 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4509 event pairs, 103 based on Foata normal form. 0/653 useless extension candidates. Maximal degree in co-relation 1047. Up to 243 conditions per place. [2025-01-09 21:33:58,806 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 17 selfloop transitions, 1 changer transitions 0/161 dead transitions. [2025-01-09 21:33:58,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 161 transitions, 373 flow [2025-01-09 21:33:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2025-01-09 21:33:58,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7772585669781932 [2025-01-09 21:33:58,808 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 341 flow. Second operand 3 states and 499 transitions. [2025-01-09 21:33:58,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 161 transitions, 373 flow [2025-01-09 21:33:58,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:58,810 INFO L231 Difference]: Finished difference. Result has 164 places, 161 transitions, 335 flow [2025-01-09 21:33:58,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=164, PETRI_TRANSITIONS=161} [2025-01-09 21:33:58,811 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -40 predicate places. [2025-01-09 21:33:58,811 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 161 transitions, 335 flow [2025-01-09 21:33:58,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:58,812 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:33:58,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:58,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-01-09 21:33:58,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1269763361, now seen corresponding path program 1 times [2025-01-09 21:33:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:58,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970997943] [2025-01-09 21:33:58,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:58,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 21:33:58,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:33:58,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,867 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:33:58,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970997943] [2025-01-09 21:33:58,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970997943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:58,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044323736] [2025-01-09 21:33:58,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:58,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:58,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:58,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:58,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:58,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 214 [2025-01-09 21:33:58,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 161 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:58,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 214 [2025-01-09 21:33:58,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:58,952 INFO L124 PetriNetUnfolderBase]: 113/666 cut-off events. [2025-01-09 21:33:58,953 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-09 21:33:58,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 666 events. 113/666 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3611 event pairs, 57 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 824. Up to 155 conditions per place. [2025-01-09 21:33:58,955 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 16 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2025-01-09 21:33:58,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 160 transitions, 369 flow [2025-01-09 21:33:58,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-01-09 21:33:58,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7757009345794392 [2025-01-09 21:33:58,957 INFO L175 Difference]: Start difference. First operand has 164 places, 161 transitions, 335 flow. Second operand 3 states and 498 transitions. [2025-01-09 21:33:58,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 160 transitions, 369 flow [2025-01-09 21:33:58,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 160 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:58,959 INFO L231 Difference]: Finished difference. Result has 164 places, 160 transitions, 336 flow [2025-01-09 21:33:58,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=164, PETRI_TRANSITIONS=160} [2025-01-09 21:33:58,960 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -40 predicate places. [2025-01-09 21:33:58,960 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 160 transitions, 336 flow [2025-01-09 21:33:58,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:58,960 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:33:58,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:58,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-01-09 21:33:58,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:58,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1293139417, now seen corresponding path program 1 times [2025-01-09 21:33:58,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:58,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806744196] [2025-01-09 21:33:58,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:58,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 21:33:58,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:33:58,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,414 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:33:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806744196] [2025-01-09 21:33:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806744196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651168317] [2025-01-09 21:33:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:59,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:59,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:59,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 214 [2025-01-09 21:33:59,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 160 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:59,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 214 [2025-01-09 21:33:59,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,548 INFO L124 PetriNetUnfolderBase]: 113/665 cut-off events. [2025-01-09 21:33:59,548 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-09 21:33:59,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 665 events. 113/665 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3617 event pairs, 57 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 834. Up to 160 conditions per place. [2025-01-09 21:33:59,551 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 21 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2025-01-09 21:33:59,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 159 transitions, 386 flow [2025-01-09 21:33:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 944 transitions. [2025-01-09 21:33:59,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.735202492211838 [2025-01-09 21:33:59,553 INFO L175 Difference]: Start difference. First operand has 164 places, 160 transitions, 336 flow. Second operand 6 states and 944 transitions. [2025-01-09 21:33:59,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 159 transitions, 386 flow [2025-01-09 21:33:59,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 159 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:59,555 INFO L231 Difference]: Finished difference. Result has 166 places, 159 transitions, 340 flow [2025-01-09 21:33:59,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=166, PETRI_TRANSITIONS=159} [2025-01-09 21:33:59,556 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -38 predicate places. [2025-01-09 21:33:59,556 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 159 transitions, 340 flow [2025-01-09 21:33:59,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:59,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:59,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:59,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-01-09 21:33:59,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash -22073220, now seen corresponding path program 1 times [2025-01-09 21:33:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354122259] [2025-01-09 21:33:59,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:33:59,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:33:59,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,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:33:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354122259] [2025-01-09 21:33:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354122259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464659107] [2025-01-09 21:33:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 214 [2025-01-09 21:33:59,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 159 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:59,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 214 [2025-01-09 21:33:59,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,708 INFO L124 PetriNetUnfolderBase]: 246/861 cut-off events. [2025-01-09 21:33:59,709 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-01-09 21:33:59,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 861 events. 246/861 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4900 event pairs, 56 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1334. Up to 251 conditions per place. [2025-01-09 21:33:59,711 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 0 selfloop transitions, 0 changer transitions 168/168 dead transitions. [2025-01-09 21:33:59,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 168 transitions, 424 flow [2025-01-09 21:33:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-01-09 21:33:59,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7928348909657321 [2025-01-09 21:33:59,713 INFO L175 Difference]: Start difference. First operand has 166 places, 159 transitions, 340 flow. Second operand 3 states and 509 transitions. [2025-01-09 21:33:59,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 168 transitions, 424 flow [2025-01-09 21:33:59,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 168 transitions, 414 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:59,715 INFO L231 Difference]: Finished difference. Result has 161 places, 0 transitions, 0 flow [2025-01-09 21:33:59,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=161, PETRI_TRANSITIONS=0} [2025-01-09 21:33:59,715 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -43 predicate places. [2025-01-09 21:33:59,715 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 0 transitions, 0 flow [2025-01-09 21:33:59,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:59,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (74 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (73 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (72 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (71 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (70 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (69 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (68 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (67 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (66 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (65 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (64 of 75 remaining) [2025-01-09 21:33:59,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (63 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (62 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (61 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (60 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (59 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (58 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (51 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (49 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 75 remaining) [2025-01-09 21:33:59,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (47 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (46 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (44 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (43 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (38 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (29 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (23 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (20 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (19 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (18 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 75 remaining) [2025-01-09 21:33:59,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (10 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (9 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (8 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (7 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (6 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (5 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (4 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (3 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (2 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 75 remaining) [2025-01-09 21:33:59,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 75 remaining) [2025-01-09 21:33:59,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:59,721 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:59,725 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:59,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:59,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:59 BasicIcfg [2025-01-09 21:33:59,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:59,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:59,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:59,730 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:59,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:57" (3/4) ... [2025-01-09 21:33:59,732 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:59,734 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:59,734 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:59,734 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:59,737 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 21:33:59,737 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:59,737 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:59,737 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:59,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:59,796 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:59,796 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:59,796 INFO L158 Benchmark]: Toolchain (without parser) took 3747.41ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 107.7MB in the beginning and 63.7MB in the end (delta: 44.1MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:59,797 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:59,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.89ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 95.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:59,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.60ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 92.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:59,797 INFO L158 Benchmark]: Boogie Preprocessor took 23.75ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:59,797 INFO L158 Benchmark]: RCFGBuilder took 811.86ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 92.5MB in the end (delta: -1.4MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:59,798 INFO L158 Benchmark]: TraceAbstraction took 2614.87ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 91.7MB in the beginning and 69.5MB in the end (delta: 22.3MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2025-01-09 21:33:59,798 INFO L158 Benchmark]: Witness Printer took 66.00ms. Allocated memory is still 192.9MB. Free memory was 69.5MB in the beginning and 63.7MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:59,799 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.68ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.89ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 95.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.60ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 92.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.75ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 811.86ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 92.5MB in the end (delta: -1.4MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2614.87ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 91.7MB in the beginning and 69.5MB in the end (delta: 22.3MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Witness Printer took 66.00ms. Allocated memory is still 192.9MB. Free memory was 69.5MB in the beginning and 63.7MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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 - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 284 locations, 75 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: 2.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 367 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 24 mSDtfsCounter, 367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=419occurred in iteration=0, InterpolantAutomatonStates: 30, 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.7s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 40 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:59,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE