./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_01-idx_rc.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_01-idx_rc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56a6e25282b29868c16664dd03b49f4664ee7d481a2f71d72d1017e2ed35171a --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:12,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:12,959 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:12,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:12,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:12,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:12,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:12,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:12,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:12,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:12,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:12,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:12,984 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:12,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:12,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:12,984 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:12,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:12,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:12,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:12,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:12,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:12,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:12,986 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:12,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:12,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:12,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:12,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:12,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:12,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:12,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:12,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:12,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:12,987 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 -> 56a6e25282b29868c16664dd03b49f4664ee7d481a2f71d72d1017e2ed35171a [2025-04-29 11:08:13,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:13,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:13,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:13,228 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:13,229 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:13,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_01-idx_rc.c [2025-04-29 11:08:14,505 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa26d4b1d/4429d2dbd23a4032bd90f429c7587ccf/FLAGba5d48f3f [2025-04-29 11:08:14,690 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:14,690 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/05-lval_ls_01-idx_rc.c [2025-04-29 11:08:14,692 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:14,700 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa26d4b1d/4429d2dbd23a4032bd90f429c7587ccf/FLAGba5d48f3f [2025-04-29 11:08:15,505 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa26d4b1d/4429d2dbd23a4032bd90f429c7587ccf [2025-04-29 11:08:15,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:15,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:15,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:15,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:15,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:15,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:15" (1/1) ... [2025-04-29 11:08:15,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5836c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:15, skipping insertion in model container [2025-04-29 11:08:15,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:15" (1/1) ... [2025-04-29 11:08:15,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:15,688 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:15,698 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:15,723 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:15,740 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:15,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:15 WrapperNode [2025-04-29 11:08:15,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:15,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:15,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:15,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:15,746 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:15" (1/1) ... [2025-04-29 11:08:15,753 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:15" (1/1) ... [2025-04-29 11:08:15,765 INFO L138 Inliner]: procedures = 11, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-04-29 11:08:15,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:15,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:15,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:15,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:15,772 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:15" (1/1) ... [2025-04-29 11:08:15,773 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:15" (1/1) ... [2025-04-29 11:08:15,779 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:15" (1/1) ... [2025-04-29 11:08:15,779 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:15" (1/1) ... [2025-04-29 11:08:15,782 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:15" (1/1) ... [2025-04-29 11:08:15,783 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:15" (1/1) ... [2025-04-29 11:08:15,784 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:15" (1/1) ... [2025-04-29 11:08:15,785 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:15" (1/1) ... [2025-04-29 11:08:15,785 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:15" (1/1) ... [2025-04-29 11:08:15,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:15,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:15,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:15,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:15,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:15" (1/1) ... [2025-04-29 11:08:15,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:15,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:15,823 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:15,827 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:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:15,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:15,846 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:15,848 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:15,911 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:15,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:16,031 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:16,031 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:16,047 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:16,048 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:16,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:16 BoogieIcfgContainer [2025-04-29 11:08:16,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:16,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:16,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:16,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:16,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:15" (1/3) ... [2025-04-29 11:08:16,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6abac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:16, skipping insertion in model container [2025-04-29 11:08:16,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:15" (2/3) ... [2025-04-29 11:08:16,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6abac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:16, skipping insertion in model container [2025-04-29 11:08:16,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:16" (3/3) ... [2025-04-29 11:08:16,054 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_01-idx_rc.c [2025-04-29 11:08:16,063 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:16,065 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_01-idx_rc.c that has 2 procedures, 70 locations, 69 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-29 11:08:16,065 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:16,101 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:16,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 70 transitions, 144 flow [2025-04-29 11:08:16,169 INFO L116 PetriNetUnfolderBase]: 1/69 cut-off events. [2025-04-29 11:08:16,171 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:16,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 69 events. 1/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-04-29 11:08:16,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 70 transitions, 144 flow [2025-04-29 11:08:16,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 69 transitions, 141 flow [2025-04-29 11:08:16,189 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:16,198 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;@3ebb42d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:16,199 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:08:16,215 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:16,215 INFO L116 PetriNetUnfolderBase]: 1/38 cut-off events. [2025-04-29 11:08:16,216 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:16,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:16,216 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] [2025-04-29 11:08:16,217 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:16,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1910172582, now seen corresponding path program 1 times [2025-04-29 11:08:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:16,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167315148] [2025-04-29 11:08:16,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:16,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:08:16,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:08:16,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:16,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:16,399 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:16,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:16,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167315148] [2025-04-29 11:08:16,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167315148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:16,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:16,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:16,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319353457] [2025-04-29 11:08:16,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:16,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:16,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:16,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:16,443 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 70 [2025-04-29 11:08:16,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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:16,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:16,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 70 [2025-04-29 11:08:16,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:16,490 INFO L116 PetriNetUnfolderBase]: 7/130 cut-off events. [2025-04-29 11:08:16,491 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:16,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 130 events. 7/130 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 248 event pairs, 6 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 113. Up to 24 conditions per place. [2025-04-29 11:08:16,492 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 10 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-04-29 11:08:16,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 167 flow [2025-04-29 11:08:16,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2025-04-29 11:08:16,502 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-04-29 11:08:16,503 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 141 flow. Second operand 3 states and 190 transitions. [2025-04-29 11:08:16,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 167 flow [2025-04-29 11:08:16,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:16,514 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 152 flow [2025-04-29 11:08:16,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2025-04-29 11:08:16,520 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2025-04-29 11:08:16,521 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 152 flow [2025-04-29 11:08:16,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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:16,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:16,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:16,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:16,523 INFO L403 AbstractCegarLoop]: === Iteration 2 === 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:16,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash -431345527, now seen corresponding path program 1 times [2025-04-29 11:08:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:16,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107911464] [2025-04-29 11:08:16,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:16,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:16,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:08:16,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:08:16,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:16,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:16,665 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:16,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:16,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107911464] [2025-04-29 11:08:16,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107911464] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:16,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950760022] [2025-04-29 11:08:16,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:16,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:16,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:16,669 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:16,669 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:16,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:08:16,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:08:16,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:16,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:16,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:16,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:08:16,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:16,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950760022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:16,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:16,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:16,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532283038] [2025-04-29 11:08:16,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:16,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:16,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:16,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:16,773 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 70 [2025-04-29 11:08:16,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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:16,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:16,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 70 [2025-04-29 11:08:16,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:16,855 INFO L116 PetriNetUnfolderBase]: 32/219 cut-off events. [2025-04-29 11:08:16,855 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:16,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 219 events. 32/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 886 event pairs, 13 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 280. Up to 44 conditions per place. [2025-04-29 11:08:16,859 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 17 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2025-04-29 11:08:16,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 80 transitions, 218 flow [2025-04-29 11:08:16,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2025-04-29 11:08:16,861 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-04-29 11:08:16,861 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 152 flow. Second operand 3 states and 196 transitions. [2025-04-29 11:08:16,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 80 transitions, 218 flow [2025-04-29 11:08:16,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:16,867 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 202 flow [2025-04-29 11:08:16,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2025-04-29 11:08:16,868 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2025-04-29 11:08:16,868 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 202 flow [2025-04-29 11:08:16,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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:16,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:16,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:16,875 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:17,069 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:17,070 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:17,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1434601758, now seen corresponding path program 1 times [2025-04-29 11:08:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:17,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159739846] [2025-04-29 11:08:17,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:17,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:08:17,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:08:17,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:17,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:17,161 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:17,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:17,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159739846] [2025-04-29 11:08:17,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159739846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:17,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970624531] [2025-04-29 11:08:17,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:17,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:17,164 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:17,165 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:17,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:08:17,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:08:17,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:17,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:17,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:17,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:08:17,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:17,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970624531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:17,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:17,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:17,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377742158] [2025-04-29 11:08:17,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:17,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:17,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:17,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:17,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:17,261 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 70 [2025-04-29 11:08:17,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:17,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:17,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 70 [2025-04-29 11:08:17,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:17,308 INFO L116 PetriNetUnfolderBase]: 47/279 cut-off events. [2025-04-29 11:08:17,308 INFO L117 PetriNetUnfolderBase]: For 89/94 co-relation queries the response was YES. [2025-04-29 11:08:17,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 279 events. 47/279 cut-off events. For 89/94 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1311 event pairs, 21 based on Foata normal form. 3/263 useless extension candidates. Maximal degree in co-relation 451. Up to 86 conditions per place. [2025-04-29 11:08:17,311 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 16 selfloop transitions, 7 changer transitions 1/83 dead transitions. [2025-04-29 11:08:17,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 274 flow [2025-04-29 11:08:17,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-04-29 11:08:17,315 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9095238095238095 [2025-04-29 11:08:17,315 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 202 flow. Second operand 3 states and 191 transitions. [2025-04-29 11:08:17,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 274 flow [2025-04-29 11:08:17,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 83 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:17,318 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 246 flow [2025-04-29 11:08:17,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2025-04-29 11:08:17,318 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2025-04-29 11:08:17,319 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 246 flow [2025-04-29 11:08:17,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:17,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:17,319 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] [2025-04-29 11:08:17,325 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:17,519 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,SelfDestructingSolverStorable2 [2025-04-29 11:08:17,520 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:17,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1934451390, now seen corresponding path program 1 times [2025-04-29 11:08:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:17,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667918791] [2025-04-29 11:08:17,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:17,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:17,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:08:17,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:08:17,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:17,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:17,592 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:17,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:17,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667918791] [2025-04-29 11:08:17,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667918791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:17,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064258765] [2025-04-29 11:08:17,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:17,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:17,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:17,594 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:17,598 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:17,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:08:17,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:08:17,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:17,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:17,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:17,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:08:17,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:17,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064258765] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:17,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:17,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:17,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254432475] [2025-04-29 11:08:17,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:17,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:17,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:17,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:17,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:17,679 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2025-04-29 11:08:17,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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:17,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:17,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2025-04-29 11:08:17,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:17,738 INFO L116 PetriNetUnfolderBase]: 66/346 cut-off events. [2025-04-29 11:08:17,739 INFO L117 PetriNetUnfolderBase]: For 217/225 co-relation queries the response was YES. [2025-04-29 11:08:17,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 346 events. 66/346 cut-off events. For 217/225 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1774 event pairs, 25 based on Foata normal form. 2/330 useless extension candidates. Maximal degree in co-relation 650. Up to 115 conditions per place. [2025-04-29 11:08:17,740 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 17 selfloop transitions, 7 changer transitions 7/88 dead transitions. [2025-04-29 11:08:17,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 332 flow [2025-04-29 11:08:17,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-04-29 11:08:17,741 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8904761904761904 [2025-04-29 11:08:17,742 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 246 flow. Second operand 3 states and 187 transitions. [2025-04-29 11:08:17,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 332 flow [2025-04-29 11:08:17,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 88 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:17,745 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 264 flow [2025-04-29 11:08:17,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2025-04-29 11:08:17,746 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 9 predicate places. [2025-04-29 11:08:17,746 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 264 flow [2025-04-29 11:08:17,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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:17,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:17,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:17,753 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:17,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:17,951 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:17,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -880114925, now seen corresponding path program 1 times [2025-04-29 11:08:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:17,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321944934] [2025-04-29 11:08:17,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:17,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:08:17,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:08:17,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:17,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:18,037 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:18,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:18,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321944934] [2025-04-29 11:08:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321944934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:18,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104713673] [2025-04-29 11:08:18,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:18,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:18,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:18,043 INFO L229 MonitoredProcess]: Starting monitored process 5 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:18,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:08:18,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:08:18,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:08:18,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:18,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:18,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:08:18,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:18,119 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:18,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:18,149 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:18,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104713673] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:18,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:18,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:08:18,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091312479] [2025-04-29 11:08:18,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:18,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:18,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:18,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:18,180 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 70 [2025-04-29 11:08:18,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 264 flow. Second operand has 10 states, 10 states have (on average 58.1) internal successors, (581), 10 states have internal predecessors, (581), 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:18,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:18,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 70 [2025-04-29 11:08:18,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:18,255 INFO L116 PetriNetUnfolderBase]: 25/278 cut-off events. [2025-04-29 11:08:18,255 INFO L117 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-04-29 11:08:18,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 278 events. 25/278 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1309 event pairs, 10 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 461. Up to 37 conditions per place. [2025-04-29 11:08:18,258 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 14 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2025-04-29 11:08:18,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 328 flow [2025-04-29 11:08:18,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 529 transitions. [2025-04-29 11:08:18,259 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8396825396825397 [2025-04-29 11:08:18,259 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 264 flow. Second operand 9 states and 529 transitions. [2025-04-29 11:08:18,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 328 flow [2025-04-29 11:08:18,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 88 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:18,263 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 300 flow [2025-04-29 11:08:18,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=300, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2025-04-29 11:08:18,265 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 18 predicate places. [2025-04-29 11:08:18,265 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 300 flow [2025-04-29 11:08:18,266 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.1) internal successors, (581), 10 states have internal predecessors, (581), 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:18,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:18,266 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] [2025-04-29 11:08:18,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:08:18,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:18,467 INFO L403 AbstractCegarLoop]: === Iteration 6 === 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:18,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1993785411, now seen corresponding path program 2 times [2025-04-29 11:08:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:18,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143261711] [2025-04-29 11:08:18,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:18,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:08:18,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:08:18,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:08:18,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:18,572 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:18,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:18,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143261711] [2025-04-29 11:08:18,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143261711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:18,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31017862] [2025-04-29 11:08:18,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:18,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:18,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:18,574 INFO L229 MonitoredProcess]: Starting monitored process 6 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:18,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:08:18,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:08:18,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:08:18,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:08:18,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:18,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:08:18,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:18,673 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:18,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:18,760 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:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31017862] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:18,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:08:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640640812] [2025-04-29 11:08:18,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:18,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:08:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:18,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:08:18,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:18,788 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 70 [2025-04-29 11:08:18,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 300 flow. Second operand has 18 states, 18 states have (on average 58.05555555555556) internal successors, (1045), 18 states have internal predecessors, (1045), 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:18,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:18,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 70 [2025-04-29 11:08:18,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:18,950 INFO L116 PetriNetUnfolderBase]: 25/298 cut-off events. [2025-04-29 11:08:18,950 INFO L117 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-04-29 11:08:18,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 298 events. 25/298 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1306 event pairs, 10 based on Foata normal form. 4/290 useless extension candidates. Maximal degree in co-relation 442. Up to 37 conditions per place. [2025-04-29 11:08:18,951 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 18 selfloop transitions, 21 changer transitions 0/104 dead transitions. [2025-04-29 11:08:18,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 474 flow [2025-04-29 11:08:18,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:08:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:08:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1219 transitions. [2025-04-29 11:08:18,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8292517006802721 [2025-04-29 11:08:18,953 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 300 flow. Second operand 21 states and 1219 transitions. [2025-04-29 11:08:18,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 474 flow [2025-04-29 11:08:18,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 460 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:18,959 INFO L231 Difference]: Finished difference. Result has 114 places, 99 transitions, 424 flow [2025-04-29 11:08:18,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=424, PETRI_PLACES=114, PETRI_TRANSITIONS=99} [2025-04-29 11:08:18,959 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 42 predicate places. [2025-04-29 11:08:18,959 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 99 transitions, 424 flow [2025-04-29 11:08:18,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 58.05555555555556) internal successors, (1045), 18 states have internal predecessors, (1045), 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:18,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:18,960 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] [2025-04-29 11:08:18,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:19,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:19,164 INFO L403 AbstractCegarLoop]: === Iteration 7 === 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:19,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash -561948575, now seen corresponding path program 3 times [2025-04-29 11:08:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:19,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255902094] [2025-04-29 11:08:19,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:19,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 8 equivalence classes. [2025-04-29 11:08:19,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 11:08:19,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-29 11:08:19,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:19,445 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:19,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:19,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255902094] [2025-04-29 11:08:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255902094] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:19,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855848432] [2025-04-29 11:08:19,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:19,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:19,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:19,449 INFO L229 MonitoredProcess]: Starting monitored process 7 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:19,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:08:19,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 8 equivalence classes. [2025-04-29 11:08:19,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 11:08:19,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-29 11:08:19,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:19,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:08:19,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:19,590 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:19,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:19,771 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:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855848432] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:19,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:08:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769644069] [2025-04-29 11:08:19,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:19,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:08:19,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:19,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:08:19,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:08:19,812 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 70 [2025-04-29 11:08:19,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 99 transitions, 424 flow. Second operand has 23 states, 23 states have (on average 58.130434782608695) internal successors, (1337), 23 states have internal predecessors, (1337), 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:19,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:19,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 70 [2025-04-29 11:08:19,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:20,135 INFO L116 PetriNetUnfolderBase]: 25/313 cut-off events. [2025-04-29 11:08:20,135 INFO L117 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-04-29 11:08:20,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 313 events. 25/313 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1306 event pairs, 10 based on Foata normal form. 3/304 useless extension candidates. Maximal degree in co-relation 446. Up to 37 conditions per place. [2025-04-29 11:08:20,137 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 21 selfloop transitions, 30 changer transitions 0/116 dead transitions. [2025-04-29 11:08:20,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 116 transitions, 654 flow [2025-04-29 11:08:20,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:08:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:08:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1734 transitions. [2025-04-29 11:08:20,140 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8257142857142857 [2025-04-29 11:08:20,140 INFO L175 Difference]: Start difference. First operand has 114 places, 99 transitions, 424 flow. Second operand 30 states and 1734 transitions. [2025-04-29 11:08:20,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 116 transitions, 654 flow [2025-04-29 11:08:20,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 116 transitions, 624 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-04-29 11:08:20,144 INFO L231 Difference]: Finished difference. Result has 141 places, 109 transitions, 552 flow [2025-04-29 11:08:20,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=552, PETRI_PLACES=141, PETRI_TRANSITIONS=109} [2025-04-29 11:08:20,144 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 69 predicate places. [2025-04-29 11:08:20,144 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 109 transitions, 552 flow [2025-04-29 11:08:20,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 58.130434782608695) internal successors, (1337), 23 states have internal predecessors, (1337), 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:20,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:20,145 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] [2025-04-29 11:08:20,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:20,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:20,346 INFO L403 AbstractCegarLoop]: === Iteration 8 === 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:20,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:20,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1621601696, now seen corresponding path program 4 times [2025-04-29 11:08:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:20,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462730454] [2025-04-29 11:08:20,347 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:20,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:20,354 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 90 statements into 2 equivalence classes. [2025-04-29 11:08:20,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-04-29 11:08:20,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:08:20,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:20,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:08:20,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-29 11:08:20,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-29 11:08:20,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:20,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:20,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:08:20,392 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:08:20,392 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-04-29 11:08:20,393 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-29 11:08:20,393 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-29 11:08:20,394 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-29 11:08:20,394 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-29 11:08:20,394 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-29 11:08:20,394 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-29 11:08:20,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:20,394 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-04-29 11:08:20,449 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:08:20,449 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:08:20,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:08:20 BasicIcfg [2025-04-29 11:08:20,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:08:20,453 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:08:20,453 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:08:20,454 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:08:20,454 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:16" (3/4) ... [2025-04-29 11:08:20,455 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:08:20,496 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-04-29 11:08:20,530 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:08:20,530 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:08:20,530 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:08:20,531 INFO L158 Benchmark]: Toolchain (without parser) took 5023.44ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 75.0MB in the end (delta: 30.5MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2025-04-29 11:08:20,531 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:20,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.81ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 91.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:20,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.26ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:20,531 INFO L158 Benchmark]: Boogie Preprocessor took 20.13ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.6MB in the end (delta: 929.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:20,532 INFO L158 Benchmark]: RCFGBuilder took 256.63ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 75.6MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:20,532 INFO L158 Benchmark]: TraceAbstraction took 4403.20ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 83.2MB in the end (delta: -8.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:20,532 INFO L158 Benchmark]: Witness Printer took 77.09ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 75.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:20,534 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.20ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.81ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 91.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.26ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.13ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.6MB in the end (delta: 929.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 256.63ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 75.6MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4403.20ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 83.2MB in the end (delta: -8.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 77.09ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 75.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 27]: Data race detected Data race detected The following path leads to a data race: [L10] 0 int data; VAL [data=0] [L11] 0 pthread_mutex_t m[10]; VAL [data=0, m={1:0}] [L21] 0 int i = 0; VAL [data=0, i=0, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=1, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=2, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=3, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=4, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=5, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=6, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=7, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=8, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=9, m={1:0}] [L21] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L21] 0 i++ VAL [data=0, i=10, m={1:0}] [L21] COND FALSE 0 !(i < 10) VAL [data=0, m={1:0}] [L24] 0 pthread_t id; VAL [data=0, m={1:0}] [L25] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, NULL) VAL [\at(arg, Pre)={0:0}, data=0, id=-1, m={1:0}] [L15] 1 data++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, m={1:0}] [L27] 0 data++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, id=-1, m={1:0}] [L15] 1 data++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=1, m={1:0}] [L27] 0 data++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=1, id=-1, m={1:0}] Now there is a data race on ~data~0 between C: data++ [15] and C: data++ [27] - UnprovableResult [Line: 27]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 15]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 15]: 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, 90 locations, 89 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: 4.3s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 471 IncrementalHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 16 mSDtfsCounter, 471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 540 GetRequests, 437 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=7, InterpolantAutomatonStates: 72, 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, 1.3s InterpolantComputationTime, 702 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 771 ConstructedInterpolants, 0 QuantifiedInterpolants, 1163 SizeOfPredicates, 23 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 3/399 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:20,545 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)