./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_09-tricky_address4.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/06-symbeq_09-tricky_address4.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 1f3bfcbefa47ffbbca39d8d8566e5ce2761e25d53033962fa4c6edf41ef0c3ed --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:31,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:31,397 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:31,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:31,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:31,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:31,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:31,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:31,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:31,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:31,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:31,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:31,430 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:31,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:31,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:31,430 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:31,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:31,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:31,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:31,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:31,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:31,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:31,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:31,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:31,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:31,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:31,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:31,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:31,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:31,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:31,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:31,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:31,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:31,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:31,433 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 -> 1f3bfcbefa47ffbbca39d8d8566e5ce2761e25d53033962fa4c6edf41ef0c3ed [2025-04-29 11:08:31,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:31,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:31,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:31,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:31,717 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:31,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_09-tricky_address4.c [2025-04-29 11:08:33,067 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a026590c/d3d83746dbc944ecb819a157e447db10/FLAG13576703e [2025-04-29 11:08:33,262 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:33,262 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_09-tricky_address4.c [2025-04-29 11:08:33,263 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:33,263 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:33,267 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a026590c/d3d83746dbc944ecb819a157e447db10/FLAG13576703e [2025-04-29 11:08:34,116 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a026590c/d3d83746dbc944ecb819a157e447db10 [2025-04-29 11:08:34,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:34,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:34,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:34,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:34,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:34,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:34" (1/1) ... [2025-04-29 11:08:34,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3a3610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:34, skipping insertion in model container [2025-04-29 11:08:34,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:34" (1/1) ... [2025-04-29 11:08:34,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:34,293 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:34,303 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:34,334 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:34,350 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:34,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:34 WrapperNode [2025-04-29 11:08:34,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:34,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:34,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:34,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:34,356 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:34" (1/1) ... [2025-04-29 11:08:34,363 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:34" (1/1) ... [2025-04-29 11:08:34,386 INFO L138 Inliner]: procedures = 14, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2025-04-29 11:08:34,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:34,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:34,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:34,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:34,394 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:34" (1/1) ... [2025-04-29 11:08:34,394 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:34" (1/1) ... [2025-04-29 11:08:34,401 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:34" (1/1) ... [2025-04-29 11:08:34,402 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:34" (1/1) ... [2025-04-29 11:08:34,410 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:34" (1/1) ... [2025-04-29 11:08:34,411 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:34" (1/1) ... [2025-04-29 11:08:34,412 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:34" (1/1) ... [2025-04-29 11:08:34,417 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:34" (1/1) ... [2025-04-29 11:08:34,418 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:34" (1/1) ... [2025-04-29 11:08:34,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:34,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:34,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:34,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:34,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:34" (1/1) ... [2025-04-29 11:08:34,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:34,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:34,449 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:34,451 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:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:34,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:34,465 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:34,466 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:34,531 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:34,532 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:34,783 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:34,783 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:34,812 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:34,812 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:34,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:34 BoogieIcfgContainer [2025-04-29 11:08:34,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:34,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:34,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:34,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:34,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:34" (1/3) ... [2025-04-29 11:08:34,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459d1d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:34, skipping insertion in model container [2025-04-29 11:08:34,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:34" (2/3) ... [2025-04-29 11:08:34,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459d1d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:34, skipping insertion in model container [2025-04-29 11:08:34,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:34" (3/3) ... [2025-04-29 11:08:34,821 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_09-tricky_address4.c [2025-04-29 11:08:34,831 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:34,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_09-tricky_address4.c that has 2 procedures, 121 locations, 122 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-29 11:08:34,832 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:34,904 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:34,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 123 transitions, 250 flow [2025-04-29 11:08:34,986 INFO L116 PetriNetUnfolderBase]: 3/122 cut-off events. [2025-04-29 11:08:34,989 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:34,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2025-04-29 11:08:34,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 123 transitions, 250 flow [2025-04-29 11:08:34,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 122 transitions, 247 flow [2025-04-29 11:08:35,003 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:35,011 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;@46f70cb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:35,011 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:08:35,037 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:35,037 INFO L116 PetriNetUnfolderBase]: 3/72 cut-off events. [2025-04-29 11:08:35,037 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:35,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:35,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:35,038 INFO L403 AbstractCegarLoop]: === Iteration 1 === 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:35,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:35,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1225955442, now seen corresponding path program 1 times [2025-04-29 11:08:35,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:35,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245871827] [2025-04-29 11:08:35,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:35,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:08:35,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:08:35,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:35,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:35,257 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:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:35,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245871827] [2025-04-29 11:08:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245871827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:35,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909756889] [2025-04-29 11:08:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:35,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:35,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:35,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:35,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:35,321 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 123 [2025-04-29 11:08:35,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 122 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:35,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:35,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 123 [2025-04-29 11:08:35,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:35,380 INFO L116 PetriNetUnfolderBase]: 7/184 cut-off events. [2025-04-29 11:08:35,381 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:35,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 184 events. 7/184 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 328 event pairs, 6 based on Foata normal form. 5/177 useless extension candidates. Maximal degree in co-relation 147. Up to 24 conditions per place. [2025-04-29 11:08:35,382 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 10 selfloop transitions, 2 changer transitions 1/121 dead transitions. [2025-04-29 11:08:35,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 269 flow [2025-04-29 11:08:35,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2025-04-29 11:08:35,395 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9349593495934959 [2025-04-29 11:08:35,396 INFO L175 Difference]: Start difference. First operand has 123 places, 122 transitions, 247 flow. Second operand 3 states and 345 transitions. [2025-04-29 11:08:35,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 121 transitions, 269 flow [2025-04-29 11:08:35,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:35,407 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 252 flow [2025-04-29 11:08:35,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2025-04-29 11:08:35,413 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 2 predicate places. [2025-04-29 11:08:35,413 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 252 flow [2025-04-29 11:08:35,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:35,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:35,413 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] [2025-04-29 11:08:35,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:35,414 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:35,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1444201427, now seen corresponding path program 1 times [2025-04-29 11:08:35,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:35,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272783349] [2025-04-29 11:08:35,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:35,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:08:35,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:08:35,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:35,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:35,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:35,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272783349] [2025-04-29 11:08:35,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272783349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:35,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866200617] [2025-04-29 11:08:35,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:35,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:35,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:35,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:35,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:08:35,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:08:35,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:08:35,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:35,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:35,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:08:35,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:35,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:35,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866200617] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:35,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:35,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:08:35,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987799778] [2025-04-29 11:08:35,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:35,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:35,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:35,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:35,754 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 123 [2025-04-29 11:08:35,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 252 flow. Second operand has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 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:35,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:35,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 123 [2025-04-29 11:08:35,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:35,867 INFO L116 PetriNetUnfolderBase]: 7/190 cut-off events. [2025-04-29 11:08:35,867 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:35,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 190 events. 7/190 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 323 event pairs, 6 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 194. Up to 24 conditions per place. [2025-04-29 11:08:35,870 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 14 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2025-04-29 11:08:35,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 316 flow [2025-04-29 11:08:35,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 988 transitions. [2025-04-29 11:08:35,876 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8925022583559169 [2025-04-29 11:08:35,878 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 252 flow. Second operand 9 states and 988 transitions. [2025-04-29 11:08:35,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 316 flow [2025-04-29 11:08:35,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:35,880 INFO L231 Difference]: Finished difference. Result has 134 places, 126 transitions, 300 flow [2025-04-29 11:08:35,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=300, PETRI_PLACES=134, PETRI_TRANSITIONS=126} [2025-04-29 11:08:35,881 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 11 predicate places. [2025-04-29 11:08:35,881 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 126 transitions, 300 flow [2025-04-29 11:08:35,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 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:35,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:35,885 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:08:36,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:36,090 INFO L403 AbstractCegarLoop]: === Iteration 3 === 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:36,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash -147991373, now seen corresponding path program 2 times [2025-04-29 11:08:36,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:36,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723280571] [2025-04-29 11:08:36,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:36,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:36,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-04-29 11:08:36,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 69 statements. [2025-04-29 11:08:36,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:36,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:08:36,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:36,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723280571] [2025-04-29 11:08:36,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723280571] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:36,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:36,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:36,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965145349] [2025-04-29 11:08:36,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:36,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:36,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:36,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:36,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:36,783 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 123 [2025-04-29 11:08:36,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 126 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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:36,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:36,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 123 [2025-04-29 11:08:36,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:36,934 INFO L116 PetriNetUnfolderBase]: 129/631 cut-off events. [2025-04-29 11:08:36,934 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:08:36,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 631 events. 129/631 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3520 event pairs, 46 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 888. Up to 178 conditions per place. [2025-04-29 11:08:36,940 INFO L140 encePairwiseOnDemand]: 112/123 looper letters, 43 selfloop transitions, 22 changer transitions 0/167 dead transitions. [2025-04-29 11:08:36,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 167 transitions, 512 flow [2025-04-29 11:08:36,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2025-04-29 11:08:36,943 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8780487804878049 [2025-04-29 11:08:36,943 INFO L175 Difference]: Start difference. First operand has 134 places, 126 transitions, 300 flow. Second operand 6 states and 648 transitions. [2025-04-29 11:08:36,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 167 transitions, 512 flow [2025-04-29 11:08:36,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 167 transitions, 506 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:36,964 INFO L231 Difference]: Finished difference. Result has 142 places, 148 transitions, 440 flow [2025-04-29 11:08:36,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=142, PETRI_TRANSITIONS=148} [2025-04-29 11:08:36,965 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 19 predicate places. [2025-04-29 11:08:36,965 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 148 transitions, 440 flow [2025-04-29 11:08:36,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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:36,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:36,966 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:36,966 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:36,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:36,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1789261283, now seen corresponding path program 1 times [2025-04-29 11:08:36,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:36,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756172574] [2025-04-29 11:08:36,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:36,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:36,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:08:36,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:08:36,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:36,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:37,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:37,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756172574] [2025-04-29 11:08:37,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756172574] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:37,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784136530] [2025-04-29 11:08:37,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:37,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:37,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:37,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:37,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:08:37,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:08:37,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:08:37,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:37,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:37,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:08:37,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:37,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:37,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784136530] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:37,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:37,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:08:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515229719] [2025-04-29 11:08:37,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:37,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:08:37,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:37,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:08:37,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:37,363 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 123 [2025-04-29 11:08:37,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 148 transitions, 440 flow. Second operand has 18 states, 18 states have (on average 109.0) internal successors, (1962), 18 states have internal predecessors, (1962), 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:37,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:37,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 123 [2025-04-29 11:08:37,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:37,578 INFO L116 PetriNetUnfolderBase]: 41/466 cut-off events. [2025-04-29 11:08:37,579 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-29 11:08:37,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 466 events. 41/466 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2219 event pairs, 16 based on Foata normal form. 4/443 useless extension candidates. Maximal degree in co-relation 629. Up to 55 conditions per place. [2025-04-29 11:08:37,581 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 18 selfloop transitions, 21 changer transitions 0/166 dead transitions. [2025-04-29 11:08:37,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 166 transitions, 606 flow [2025-04-29 11:08:37,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:08:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:08:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2290 transitions. [2025-04-29 11:08:37,586 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.886566008517228 [2025-04-29 11:08:37,586 INFO L175 Difference]: Start difference. First operand has 142 places, 148 transitions, 440 flow. Second operand 21 states and 2290 transitions. [2025-04-29 11:08:37,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 166 transitions, 606 flow [2025-04-29 11:08:37,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 166 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:37,592 INFO L231 Difference]: Finished difference. Result has 167 places, 161 transitions, 570 flow [2025-04-29 11:08:37,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=570, PETRI_PLACES=167, PETRI_TRANSITIONS=161} [2025-04-29 11:08:37,593 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 44 predicate places. [2025-04-29 11:08:37,594 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 161 transitions, 570 flow [2025-04-29 11:08:37,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 109.0) internal successors, (1962), 18 states have internal predecessors, (1962), 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:37,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:37,595 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:37,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:08:37,796 INFO L403 AbstractCegarLoop]: === Iteration 5 === 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:37,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2005299293, now seen corresponding path program 2 times [2025-04-29 11:08:37,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:37,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26505999] [2025-04-29 11:08:37,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:37,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:37,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-04-29 11:08:37,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 62 of 97 statements. [2025-04-29 11:08:37,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:37,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-29 11:08:38,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:38,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26505999] [2025-04-29 11:08:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26505999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:38,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:38,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247236074] [2025-04-29 11:08:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:38,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:38,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:38,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:38,241 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 123 [2025-04-29 11:08:38,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 161 transitions, 570 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 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:38,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:38,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 123 [2025-04-29 11:08:38,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:38,457 INFO L116 PetriNetUnfolderBase]: 306/1298 cut-off events. [2025-04-29 11:08:38,457 INFO L117 PetriNetUnfolderBase]: For 284/294 co-relation queries the response was YES. [2025-04-29 11:08:38,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2465 conditions, 1298 events. 306/1298 cut-off events. For 284/294 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9055 event pairs, 116 based on Foata normal form. 5/1190 useless extension candidates. Maximal degree in co-relation 2308. Up to 464 conditions per place. [2025-04-29 11:08:38,465 INFO L140 encePairwiseOnDemand]: 108/123 looper letters, 72 selfloop transitions, 36 changer transitions 2/218 dead transitions. [2025-04-29 11:08:38,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 218 transitions, 942 flow [2025-04-29 11:08:38,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2025-04-29 11:08:38,467 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8590785907859079 [2025-04-29 11:08:38,467 INFO L175 Difference]: Start difference. First operand has 167 places, 161 transitions, 570 flow. Second operand 6 states and 634 transitions. [2025-04-29 11:08:38,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 218 transitions, 942 flow [2025-04-29 11:08:38,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 218 transitions, 918 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:08:38,472 INFO L231 Difference]: Finished difference. Result has 170 places, 193 transitions, 798 flow [2025-04-29 11:08:38,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=798, PETRI_PLACES=170, PETRI_TRANSITIONS=193} [2025-04-29 11:08:38,473 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 47 predicate places. [2025-04-29 11:08:38,473 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 193 transitions, 798 flow [2025-04-29 11:08:38,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 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:38,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:38,473 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:38,474 INFO L403 AbstractCegarLoop]: === Iteration 6 === 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:38,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 300061580, now seen corresponding path program 1 times [2025-04-29 11:08:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:38,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691088446] [2025-04-29 11:08:38,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:38,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-29 11:08:38,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-29 11:08:38,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:38,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:38,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691088446] [2025-04-29 11:08:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691088446] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:38,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193225765] [2025-04-29 11:08:38,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:38,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:38,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:38,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:38,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:08:38,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-29 11:08:38,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-29 11:08:38,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:38,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:08:38,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:38,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:39,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193225765] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:39,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:39,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:08:39,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949639233] [2025-04-29 11:08:39,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:39,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:08:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:39,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:08:39,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:08:39,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 123 [2025-04-29 11:08:39,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 193 transitions, 798 flow. Second operand has 23 states, 23 states have (on average 109.08695652173913) internal successors, (2509), 23 states have internal predecessors, (2509), 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:39,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:39,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 123 [2025-04-29 11:08:39,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:39,424 INFO L116 PetriNetUnfolderBase]: 120/904 cut-off events. [2025-04-29 11:08:39,425 INFO L117 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2025-04-29 11:08:39,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 904 events. 120/904 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5994 event pairs, 33 based on Foata normal form. 3/848 useless extension candidates. Maximal degree in co-relation 1568. Up to 134 conditions per place. [2025-04-29 11:08:39,432 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 21 selfloop transitions, 30 changer transitions 0/210 dead transitions. [2025-04-29 11:08:39,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 210 transitions, 1022 flow [2025-04-29 11:08:39,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:08:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:08:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3264 transitions. [2025-04-29 11:08:39,438 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8845528455284553 [2025-04-29 11:08:39,438 INFO L175 Difference]: Start difference. First operand has 170 places, 193 transitions, 798 flow. Second operand 30 states and 3264 transitions. [2025-04-29 11:08:39,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 210 transitions, 1022 flow [2025-04-29 11:08:39,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 210 transitions, 998 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:39,446 INFO L231 Difference]: Finished difference. Result has 202 places, 203 transitions, 926 flow [2025-04-29 11:08:39,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=926, PETRI_PLACES=202, PETRI_TRANSITIONS=203} [2025-04-29 11:08:39,447 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 79 predicate places. [2025-04-29 11:08:39,448 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 203 transitions, 926 flow [2025-04-29 11:08:39,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 109.08695652173913) internal successors, (2509), 23 states have internal predecessors, (2509), 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:39,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:39,450 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:39,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:39,652 INFO L403 AbstractCegarLoop]: === Iteration 7 === 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:39,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1469596337, now seen corresponding path program 2 times [2025-04-29 11:08:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:39,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720979605] [2025-04-29 11:08:39,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:39,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:39,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-04-29 11:08:39,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 117 statements. [2025-04-29 11:08:39,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:39,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:39,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:39,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720979605] [2025-04-29 11:08:39,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720979605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:39,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:39,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:39,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166737465] [2025-04-29 11:08:39,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:39,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:39,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:39,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:40,136 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 123 [2025-04-29 11:08:40,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 203 transitions, 926 flow. Second operand has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 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:40,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:40,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 123 [2025-04-29 11:08:40,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:40,366 INFO L116 PetriNetUnfolderBase]: 306/1421 cut-off events. [2025-04-29 11:08:40,366 INFO L117 PetriNetUnfolderBase]: For 902/942 co-relation queries the response was YES. [2025-04-29 11:08:40,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 1421 events. 306/1421 cut-off events. For 902/942 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10384 event pairs, 72 based on Foata normal form. 10/1385 useless extension candidates. Maximal degree in co-relation 3050. Up to 456 conditions per place. [2025-04-29 11:08:40,372 INFO L140 encePairwiseOnDemand]: 112/123 looper letters, 80 selfloop transitions, 49 changer transitions 0/269 dead transitions. [2025-04-29 11:08:40,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 269 transitions, 1483 flow [2025-04-29 11:08:40,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2025-04-29 11:08:40,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8848238482384824 [2025-04-29 11:08:40,374 INFO L175 Difference]: Start difference. First operand has 202 places, 203 transitions, 926 flow. Second operand 6 states and 653 transitions. [2025-04-29 11:08:40,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 269 transitions, 1483 flow [2025-04-29 11:08:40,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 269 transitions, 1437 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:08:40,381 INFO L231 Difference]: Finished difference. Result has 193 places, 244 transitions, 1296 flow [2025-04-29 11:08:40,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1296, PETRI_PLACES=193, PETRI_TRANSITIONS=244} [2025-04-29 11:08:40,382 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 70 predicate places. [2025-04-29 11:08:40,383 INFO L485 AbstractCegarLoop]: Abstraction has has 193 places, 244 transitions, 1296 flow [2025-04-29 11:08:40,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 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:40,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:40,383 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:40,383 INFO L403 AbstractCegarLoop]: === Iteration 8 === 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:40,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash -17572170, now seen corresponding path program 1 times [2025-04-29 11:08:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:40,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140972646] [2025-04-29 11:08:40,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:40,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-29 11:08:40,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-29 11:08:40,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:40,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:40,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140972646] [2025-04-29 11:08:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140972646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:40,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:40,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010408070] [2025-04-29 11:08:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:40,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:40,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:40,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:40,997 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 123 [2025-04-29 11:08:40,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 244 transitions, 1296 flow. Second operand has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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:40,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:40,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 123 [2025-04-29 11:08:40,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:41,331 INFO L116 PetriNetUnfolderBase]: 579/2193 cut-off events. [2025-04-29 11:08:41,331 INFO L117 PetriNetUnfolderBase]: For 2524/2590 co-relation queries the response was YES. [2025-04-29 11:08:41,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5868 conditions, 2193 events. 579/2193 cut-off events. For 2524/2590 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17450 event pairs, 140 based on Foata normal form. 12/2121 useless extension candidates. Maximal degree in co-relation 5647. Up to 824 conditions per place. [2025-04-29 11:08:41,344 INFO L140 encePairwiseOnDemand]: 108/123 looper letters, 119 selfloop transitions, 78 changer transitions 11/338 dead transitions. [2025-04-29 11:08:41,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 338 transitions, 2236 flow [2025-04-29 11:08:41,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 639 transitions. [2025-04-29 11:08:41,346 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8658536585365854 [2025-04-29 11:08:41,346 INFO L175 Difference]: Start difference. First operand has 193 places, 244 transitions, 1296 flow. Second operand 6 states and 639 transitions. [2025-04-29 11:08:41,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 338 transitions, 2236 flow [2025-04-29 11:08:41,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 338 transitions, 2234 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:41,360 INFO L231 Difference]: Finished difference. Result has 202 places, 292 transitions, 1900 flow [2025-04-29 11:08:41,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1900, PETRI_PLACES=202, PETRI_TRANSITIONS=292} [2025-04-29 11:08:41,362 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 79 predicate places. [2025-04-29 11:08:41,362 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 292 transitions, 1900 flow [2025-04-29 11:08:41,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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:41,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:41,363 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:41,364 INFO L403 AbstractCegarLoop]: === Iteration 9 === 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:41,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash -635051938, now seen corresponding path program 1 times [2025-04-29 11:08:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:41,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659431066] [2025-04-29 11:08:41,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:41,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:41,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-04-29 11:08:41,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-04-29 11:08:41,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:41,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:41,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:08:41,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-04-29 11:08:41,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-04-29 11:08:41,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:41,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:41,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:08:41,456 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:08:41,457 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-04-29 11:08:41,458 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-29 11:08:41,458 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-29 11:08:41,458 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-29 11:08:41,459 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-29 11:08:41,459 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-29 11:08:41,459 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-29 11:08:41,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:41,459 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1] [2025-04-29 11:08:41,526 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:08:41,526 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:08:41,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:08:41 BasicIcfg [2025-04-29 11:08:41,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:08:41,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:08:41,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:08:41,534 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:08:41,534 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:34" (3/4) ... [2025-04-29 11:08:41,540 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:08:41,590 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 18. [2025-04-29 11:08:41,639 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:08:41,639 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:08:41,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:08:41,640 INFO L158 Benchmark]: Toolchain (without parser) took 7520.78ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.9MB in the beginning and 172.2MB in the end (delta: -59.4MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2025-04-29 11:08:41,640 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:41,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.63ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:41,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.68ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:41,641 INFO L158 Benchmark]: Boogie Preprocessor took 33.92ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:41,641 INFO L158 Benchmark]: RCFGBuilder took 389.47ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 76.0MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:41,641 INFO L158 Benchmark]: TraceAbstraction took 6717.48ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 75.5MB in the beginning and 67.5MB in the end (delta: 8.0MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2025-04-29 11:08:41,641 INFO L158 Benchmark]: Witness Printer took 105.96ms. Allocated memory is still 218.1MB. Free memory was 67.5MB in the beginning and 172.2MB in the end (delta: -104.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2025-04-29 11:08:41,642 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.37ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.63ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.68ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.92ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 389.47ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 76.0MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6717.48ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 75.5MB in the beginning and 67.5MB in the end (delta: 8.0MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. * Witness Printer took 105.96ms. Allocated memory is still 218.1MB. Free memory was 67.5MB in the beginning and 172.2MB in the end (delta: -104.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 43]: Data race detected Data race detected The following path leads to a data race: [L17-L20] 0 struct s { int datum; pthread_mutex_t mutex; } a[10]; VAL [a={1:0}] [L34] 0 int i = 0; VAL [a={1:0}, i=0] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=1] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=2] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=3] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=4] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=5] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=6] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=7] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=8] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=9] [L34] COND TRUE 0 i < 10 VAL [a={1:0}] [L34] 0 i++ VAL [a={1:0}, i=10] [L34] COND FALSE 0 !(i < 10) VAL [a={1:0}] [L37] 0 int i = __VERIFIER_nondet_int(); VAL [a={1:0}, i=1] [L38] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, a={1:0}, cond=1] [L38] RET 0 assume_abort_if_not(0 <= i && i < 10) [L39] 0 pthread_t t1; VAL [a={1:0}, i=1] [L40] FCALL, FORK 0 pthread_create(&t1, NULL, t_fun, NULL) VAL [a={1:0}, i=1, t1=-1] [L23] 1 int i = __VERIFIER_nondet_int(); VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=0] [L24] CALL 1 assume_abort_if_not(0 <= i && i < 9) [L11] COND FALSE 1 !(!cond) VAL [\at(cond, Pre)=1, a={1:0}, cond=1] [L24] RET 1 assume_abort_if_not(0 <= i && i < 9) [L25] 1 struct s *p = &a[i]; VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=0, p={1:0}] [L27] 1 i++ VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=1, p={1:0}] [L43] EXPR 0 a[i].datum VAL [a={1:0}, i=1, t1=-1] [L43] 0 a[i].datum++ VAL [a={1:0}, i=1, t1=-1] [L28] EXPR 1 a[i].datum VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=1, p={1:0}] [L28] 1 a[i].datum++ VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=1, p={1:0}] [L43] 0 a[i].datum++ VAL [a={1:0}, i=1, t1=-1] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: a[i].datum++ [43] * C: a[i].datum++ [28] * C: a[i].datum++ [43] * C: a[i].datum++ [43] * C: a[i].datum++ [43] and C: a[i].datum++ [43] - UnprovableResult [Line: 43]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 40]: 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: 28]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 28]: 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, 164 locations, 166 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: 6.5s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 936 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 684 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2011 IncrementalHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 24 mSDtfsCounter, 2011 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 455 SyntacticMatches, 11 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1900occurred in iteration=8, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 969 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 1972 SizeOfPredicates, 22 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 600/993 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:41,660 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)