./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_45-escape_rc.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_45-escape_rc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9d084a87e829f0714ea9740d57084c27a572a26dbf4f4c49019b90dc4e1092e0 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:07,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:07,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:07,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:07,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:07,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:07,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:07,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:07,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:07,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:07,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:07,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:07,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:07,466 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:07,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:07,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:07,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:07,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:07,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:07,468 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/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 -> 9d084a87e829f0714ea9740d57084c27a572a26dbf4f4c49019b90dc4e1092e0 [2025-04-29 11:08:07,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:07,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:07,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:07,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:07,701 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:07,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_45-escape_rc.c [2025-04-29 11:08:08,973 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb5eef87/25f107b812b94fd7a56bb91b8cb019cc/FLAG615e90684 [2025-04-29 11:08:09,208 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:09,209 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_45-escape_rc.c [2025-04-29 11:08:09,211 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:09,211 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:09,216 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb5eef87/25f107b812b94fd7a56bb91b8cb019cc/FLAG615e90684 [2025-04-29 11:08:10,024 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb5eef87/25f107b812b94fd7a56bb91b8cb019cc [2025-04-29 11:08:10,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:10,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:10,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:10,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:10,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:10,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262f100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10, skipping insertion in model container [2025-04-29 11:08:10,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:10,189 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:10,196 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:10,226 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:10,238 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:10,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10 WrapperNode [2025-04-29 11:08:10,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:10,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:10,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:10,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:10,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,267 INFO L138 Inliner]: procedures = 12, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-04-29 11:08:10,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:10,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:10,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:10,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:10,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:10,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:10,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:10,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:10,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (1/1) ... [2025-04-29 11:08:10,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:10,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:10,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:08:10,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:08:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:08:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:08:10,341 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:08:10,405 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:10,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:10,556 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:10,556 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:10,573 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:10,574 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:10,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:10 BoogieIcfgContainer [2025-04-29 11:08:10,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:10,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:10,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:10,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:10,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:10" (1/3) ... [2025-04-29 11:08:10,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bb7865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:10, skipping insertion in model container [2025-04-29 11:08:10,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:10" (2/3) ... [2025-04-29 11:08:10,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bb7865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:10, skipping insertion in model container [2025-04-29 11:08:10,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:10" (3/3) ... [2025-04-29 11:08:10,584 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_45-escape_rc.c [2025-04-29 11:08:10,594 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:10,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_45-escape_rc.c that has 2 procedures, 77 locations, 75 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-29 11:08:10,596 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:10,656 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:08:10,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 76 transitions, 159 flow [2025-04-29 11:08:10,706 INFO L116 PetriNetUnfolderBase]: 0/75 cut-off events. [2025-04-29 11:08:10,709 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:10,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 75 events. 0/75 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-29 11:08:10,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 76 transitions, 159 flow [2025-04-29 11:08:10,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 139 flow [2025-04-29 11:08:10,721 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:10,733 INFO L340 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;@6625837f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:10,734 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:08:10,746 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:10,748 INFO L116 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-04-29 11:08:10,748 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:10,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:10,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:10,749 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:10,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2137050172, now seen corresponding path program 1 times [2025-04-29 11:08:10,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:10,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643463207] [2025-04-29 11:08:10,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:10,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:10,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:08:10,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:08:10,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:10,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:11,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:11,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643463207] [2025-04-29 11:08:11,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643463207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:11,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:11,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734681648] [2025-04-29 11:08:11,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:11,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:11,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:11,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:11,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 76 [2025-04-29 11:08:11,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 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-04-29 11:08:11,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:11,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 76 [2025-04-29 11:08:11,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:11,633 INFO L116 PetriNetUnfolderBase]: 102/405 cut-off events. [2025-04-29 11:08:11,633 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:11,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 405 events. 102/405 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2043 event pairs, 49 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 618. Up to 181 conditions per place. [2025-04-29 11:08:11,638 INFO L140 encePairwiseOnDemand]: 65/76 looper letters, 28 selfloop transitions, 22 changer transitions 0/97 dead transitions. [2025-04-29 11:08:11,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 297 flow [2025-04-29 11:08:11,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 375 transitions. [2025-04-29 11:08:11,655 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8223684210526315 [2025-04-29 11:08:11,657 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 139 flow. Second operand 6 states and 375 transitions. [2025-04-29 11:08:11,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 297 flow [2025-04-29 11:08:11,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 97 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:11,665 INFO L231 Difference]: Finished difference. Result has 81 places, 89 transitions, 288 flow [2025-04-29 11:08:11,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=81, PETRI_TRANSITIONS=89} [2025-04-29 11:08:11,672 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 9 predicate places. [2025-04-29 11:08:11,673 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 288 flow [2025-04-29 11:08:11,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 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-04-29 11:08:11,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:11,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:11,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:11,675 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:11,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:11,675 INFO L85 PathProgramCache]: Analyzing trace with hash -445565279, now seen corresponding path program 1 times [2025-04-29 11:08:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:11,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498054177] [2025-04-29 11:08:11,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:11,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:11,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:08:11,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:08:11,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:11,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:11,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:11,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498054177] [2025-04-29 11:08:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498054177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:11,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:11,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13447317] [2025-04-29 11:08:11,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:11,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:11,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:11,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:12,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 76 [2025-04-29 11:08:12,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 89 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 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-04-29 11:08:12,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:12,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 76 [2025-04-29 11:08:12,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:12,170 INFO L116 PetriNetUnfolderBase]: 133/492 cut-off events. [2025-04-29 11:08:12,170 INFO L117 PetriNetUnfolderBase]: For 120/130 co-relation queries the response was YES. [2025-04-29 11:08:12,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 492 events. 133/492 cut-off events. For 120/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2727 event pairs, 40 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 932. Up to 221 conditions per place. [2025-04-29 11:08:12,174 INFO L140 encePairwiseOnDemand]: 65/76 looper letters, 42 selfloop transitions, 26 changer transitions 0/118 dead transitions. [2025-04-29 11:08:12,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 118 transitions, 500 flow [2025-04-29 11:08:12,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 358 transitions. [2025-04-29 11:08:12,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7850877192982456 [2025-04-29 11:08:12,175 INFO L175 Difference]: Start difference. First operand has 81 places, 89 transitions, 288 flow. Second operand 6 states and 358 transitions. [2025-04-29 11:08:12,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 118 transitions, 500 flow [2025-04-29 11:08:12,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 118 transitions, 500 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:12,179 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 472 flow [2025-04-29 11:08:12,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2025-04-29 11:08:12,180 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 19 predicate places. [2025-04-29 11:08:12,180 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 472 flow [2025-04-29 11:08:12,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 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-04-29 11:08:12,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:12,180 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] [2025-04-29 11:08:12,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:08:12,180 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:12,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:12,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1072791625, now seen corresponding path program 1 times [2025-04-29 11:08:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:12,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12229203] [2025-04-29 11:08:12,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:12,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:08:12,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:08:12,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:12,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:12,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12229203] [2025-04-29 11:08:12,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12229203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:12,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:12,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:12,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334769714] [2025-04-29 11:08:12,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:12,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:12,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:12,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:12,451 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 76 [2025-04-29 11:08:12,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 472 flow. Second operand has 6 states, 6 states have (on average 50.333333333333336) internal successors, (302), 6 states have internal predecessors, (302), 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-04-29 11:08:12,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:12,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 76 [2025-04-29 11:08:12,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:12,611 INFO L116 PetriNetUnfolderBase]: 267/868 cut-off events. [2025-04-29 11:08:12,611 INFO L117 PetriNetUnfolderBase]: For 526/543 co-relation queries the response was YES. [2025-04-29 11:08:12,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 868 events. 267/868 cut-off events. For 526/543 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5252 event pairs, 81 based on Foata normal form. 2/824 useless extension candidates. Maximal degree in co-relation 2108. Up to 476 conditions per place. [2025-04-29 11:08:12,616 INFO L140 encePairwiseOnDemand]: 61/76 looper letters, 66 selfloop transitions, 53 changer transitions 4/165 dead transitions. [2025-04-29 11:08:12,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 165 transitions, 962 flow [2025-04-29 11:08:12,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 361 transitions. [2025-04-29 11:08:12,618 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2025-04-29 11:08:12,618 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 472 flow. Second operand 6 states and 361 transitions. [2025-04-29 11:08:12,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 165 transitions, 962 flow [2025-04-29 11:08:12,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 165 transitions, 962 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:12,627 INFO L231 Difference]: Finished difference. Result has 101 places, 157 transitions, 954 flow [2025-04-29 11:08:12,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=954, PETRI_PLACES=101, PETRI_TRANSITIONS=157} [2025-04-29 11:08:12,629 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 29 predicate places. [2025-04-29 11:08:12,629 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 157 transitions, 954 flow [2025-04-29 11:08:12,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.333333333333336) internal successors, (302), 6 states have internal predecessors, (302), 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-04-29 11:08:12,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:12,629 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] [2025-04-29 11:08:12,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:12,630 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:12,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1154795565, now seen corresponding path program 1 times [2025-04-29 11:08:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:12,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116406314] [2025-04-29 11:08:12,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:12,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:08:12,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:08:12,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:12,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:12,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:12,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116406314] [2025-04-29 11:08:12,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116406314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:12,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:12,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165636066] [2025-04-29 11:08:12,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:12,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:12,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:12,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:12,916 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 76 [2025-04-29 11:08:12,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 157 transitions, 954 flow. Second operand has 6 states, 6 states have (on average 47.5) internal successors, (285), 6 states have internal predecessors, (285), 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-04-29 11:08:12,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:12,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 76 [2025-04-29 11:08:12,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:13,166 INFO L116 PetriNetUnfolderBase]: 358/1100 cut-off events. [2025-04-29 11:08:13,167 INFO L117 PetriNetUnfolderBase]: For 1438/1472 co-relation queries the response was YES. [2025-04-29 11:08:13,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3302 conditions, 1100 events. 358/1100 cut-off events. For 1438/1472 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7040 event pairs, 77 based on Foata normal form. 3/1069 useless extension candidates. Maximal degree in co-relation 3264. Up to 593 conditions per place. [2025-04-29 11:08:13,176 INFO L140 encePairwiseOnDemand]: 61/76 looper letters, 104 selfloop transitions, 61 changer transitions 10/218 dead transitions. [2025-04-29 11:08:13,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 218 transitions, 1650 flow [2025-04-29 11:08:13,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2025-04-29 11:08:13,179 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2025-04-29 11:08:13,179 INFO L175 Difference]: Start difference. First operand has 101 places, 157 transitions, 954 flow. Second operand 6 states and 344 transitions. [2025-04-29 11:08:13,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 218 transitions, 1650 flow [2025-04-29 11:08:13,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 218 transitions, 1586 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:13,195 INFO L231 Difference]: Finished difference. Result has 111 places, 204 transitions, 1476 flow [2025-04-29 11:08:13,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1476, PETRI_PLACES=111, PETRI_TRANSITIONS=204} [2025-04-29 11:08:13,197 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 39 predicate places. [2025-04-29 11:08:13,197 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 204 transitions, 1476 flow [2025-04-29 11:08:13,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.5) internal successors, (285), 6 states have internal predecessors, (285), 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-04-29 11:08:13,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:13,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:13,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:08:13,198 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:13,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash -518699795, now seen corresponding path program 1 times [2025-04-29 11:08:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:13,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943457674] [2025-04-29 11:08:13,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:13,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:08:13,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:08:13,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:13,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:13,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:08:13,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:08:13,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:08:13,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:13,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:13,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:08:13,256 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:08:13,256 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-04-29 11:08:13,257 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-29 11:08:13,257 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-29 11:08:13,258 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-29 11:08:13,258 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-29 11:08:13,258 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-29 11:08:13,258 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-29 11:08:13,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:13,258 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-29 11:08:13,311 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:08:13,311 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:08:13,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:08:13 BasicIcfg [2025-04-29 11:08:13,318 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:08:13,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:08:13,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:08:13,318 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:08:13,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:10" (3/4) ... [2025-04-29 11:08:13,319 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:08:13,371 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-04-29 11:08:13,401 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:08:13,401 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:08:13,401 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:08:13,402 INFO L158 Benchmark]: Toolchain (without parser) took 3374.04ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 112.1MB in the beginning and 130.2MB in the end (delta: -18.2MB). Peak memory consumption was 129.7MB. Max. memory is 16.1GB. [2025-04-29 11:08:13,402 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:13,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.18ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 97.9MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:13,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.74ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:13,402 INFO L158 Benchmark]: Boogie Preprocessor took 28.30ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:13,404 INFO L158 Benchmark]: RCFGBuilder took 275.12ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 80.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:13,404 INFO L158 Benchmark]: TraceAbstraction took 2742.47ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 78.9MB in the beginning and 138.6MB in the end (delta: -59.7MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2025-04-29 11:08:13,404 INFO L158 Benchmark]: Witness Printer took 82.95ms. Allocated memory is still 293.6MB. Free memory was 138.6MB in the beginning and 130.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:13,406 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.13ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.18ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 97.9MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.74ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.30ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 275.12ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 80.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2742.47ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 78.9MB in the beginning and 138.6MB in the end (delta: -59.7MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * Witness Printer took 82.95ms. Allocated memory is still 293.6MB. Free memory was 138.6MB in the beginning and 130.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 27]: Data race detected Data race detected The following path leads to a data race: [L11] 0 pthread_mutex_t mutex1 = PTHREAD_MUTEX_INITIALIZER; VAL [mutex1={1:0}] [L12] 0 pthread_mutex_t mutex2 = PTHREAD_MUTEX_INITIALIZER; VAL [mutex1={1:0}, mutex2={2:0}] [L23] 0 pthread_t id; VAL [mutex1={1:0}, mutex2={2:0}] [L24] 0 int i; VAL [i={5:0}, mutex1={1:0}, mutex2={2:0}] [L25] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, (void *) &i) VAL [\at(arg, Pre)={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}] [L15] 1 int *p = (int *) arg; VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L17] EXPR 1 \read(*p) VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L17] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L27] EXPR 0 \read(i) VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L27] 0 i++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L17] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L27] 0 i++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L17] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L27] 0 i++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L17] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L27] 0 i++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L17] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L27] 0 i++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] Now there is a data race (on the heap) between C: (*p)++ [17] and C: i++ [27] - UnprovableResult [Line: 27]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 106 locations, 105 edges, 7 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.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 736 IncrementalHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 4 mSDtfsCounter, 736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1476occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 1.0s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:08:13,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)