./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68241c415e195cda32e2ec49a31f5c0e3a220e5729b169fd07b350b195e62294 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:30:13,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:30:13,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:30:13,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:30:13,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:30:13,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:30:13,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:30:13,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:30:13,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:30:13,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:30:13,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:30:13,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:30:13,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:30:13,958 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:30:13,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:30:13,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:30:13,959 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:30:13,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:30:13,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:30:13,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:30:13,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:30:13,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:30:13,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:30:13,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:30:13,960 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68241c415e195cda32e2ec49a31f5c0e3a220e5729b169fd07b350b195e62294 [2025-02-08 05:30:14,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:30:14,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:30:14,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:30:14,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:30:14,213 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:30:14,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i [2025-02-08 05:30:15,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc089f779/3b3908a1bfc84653916943adcef7a49e/FLAGc8127640e [2025-02-08 05:30:15,754 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:30:15,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i [2025-02-08 05:30:15,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc089f779/3b3908a1bfc84653916943adcef7a49e/FLAGc8127640e [2025-02-08 05:30:15,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc089f779/3b3908a1bfc84653916943adcef7a49e [2025-02-08 05:30:15,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:30:15,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:30:15,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:30:15,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:30:15,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:30:15,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:30:15" (1/1) ... [2025-02-08 05:30:15,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df36736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:15, skipping insertion in model container [2025-02-08 05:30:15,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:30:15" (1/1) ... [2025-02-08 05:30:15,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:30:16,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:30:16,325 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:30:16,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:30:16,392 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:30:16,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16 WrapperNode [2025-02-08 05:30:16,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:30:16,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:30:16,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:30:16,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:30:16,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,429 INFO L138 Inliner]: procedures = 264, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-02-08 05:30:16,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:30:16,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:30:16,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:30:16,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:30:16,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:30:16,454 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:30:16,454 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:30:16,454 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:30:16,455 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (1/1) ... [2025-02-08 05:30:16,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:30:16,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:30:16,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:30:16,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:30:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:30:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:30:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:30:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:30:16,505 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:30:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:30:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:30:16,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:30:16,506 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:30:16,613 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:30:16,615 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:30:16,739 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:30:16,739 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:30:16,765 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:30:16,768 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:30:16,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:16 BoogieIcfgContainer [2025-02-08 05:30:16,768 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:30:16,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:30:16,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:30:16,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:30:16,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:30:15" (1/3) ... [2025-02-08 05:30:16,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba2c8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:30:16, skipping insertion in model container [2025-02-08 05:30:16,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:16" (2/3) ... [2025-02-08 05:30:16,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba2c8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:30:16, skipping insertion in model container [2025-02-08 05:30:16,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:16" (3/3) ... [2025-02-08 05:30:16,775 INFO L128 eAbstractionObserver]: Analyzing ICFG 03-practical_08-nonterm1.i [2025-02-08 05:30:16,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:30:16,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 03-practical_08-nonterm1.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 7 error locations. [2025-02-08 05:30:16,786 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:30:16,842 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:30:16,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 88 transitions, 183 flow [2025-02-08 05:30:16,913 INFO L124 PetriNetUnfolderBase]: 1/87 cut-off events. [2025-02-08 05:30:16,915 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:30:16,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 87 events. 1/87 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-02-08 05:30:16,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 88 transitions, 183 flow [2025-02-08 05:30:16,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 81 transitions, 168 flow [2025-02-08 05:30:16,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:30:16,937 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@606b3643, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:30:16,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 05:30:16,951 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:30:16,951 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-08 05:30:16,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:30:16,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:16,955 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] [2025-02-08 05:30:16,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:30:16,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash -502830137, now seen corresponding path program 1 times [2025-02-08 05:30:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340584938] [2025-02-08 05:30:16,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:17,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:30:17,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:30:17,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:17,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:17,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:17,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340584938] [2025-02-08 05:30:17,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340584938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:17,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:17,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:17,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252043925] [2025-02-08 05:30:17,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:17,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:17,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:17,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:17,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:17,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 88 [2025-02-08 05:30:17,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-02-08 05:30:17,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:17,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 88 [2025-02-08 05:30:17,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:17,290 INFO L124 PetriNetUnfolderBase]: 74/350 cut-off events. [2025-02-08 05:30:17,290 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:30:17,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 350 events. 74/350 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1590 event pairs, 27 based on Foata normal form. 8/322 useless extension candidates. Maximal degree in co-relation 488. Up to 89 conditions per place. [2025-02-08 05:30:17,293 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 25 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2025-02-08 05:30:17,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 88 transitions, 247 flow [2025-02-08 05:30:17,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2025-02-08 05:30:17,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875 [2025-02-08 05:30:17,333 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 168 flow. Second operand 3 states and 231 transitions. [2025-02-08 05:30:17,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 88 transitions, 247 flow [2025-02-08 05:30:17,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 88 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:30:17,339 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 226 flow [2025-02-08 05:30:17,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2025-02-08 05:30:17,343 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2025-02-08 05:30:17,343 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 226 flow [2025-02-08 05:30:17,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-02-08 05:30:17,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:17,344 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] [2025-02-08 05:30:17,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:30:17,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:30:17,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1973415881, now seen corresponding path program 1 times [2025-02-08 05:30:17,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:17,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431429267] [2025-02-08 05:30:17,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:17,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:17,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:30:17,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:30:17,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:17,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431429267] [2025-02-08 05:30:17,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431429267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:17,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:17,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879298077] [2025-02-08 05:30:17,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:17,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:17,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:17,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:17,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 88 [2025-02-08 05:30:17,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-08 05:30:17,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:17,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 88 [2025-02-08 05:30:17,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:17,479 INFO L124 PetriNetUnfolderBase]: 81/384 cut-off events. [2025-02-08 05:30:17,480 INFO L125 PetriNetUnfolderBase]: For 162/169 co-relation queries the response was YES. [2025-02-08 05:30:17,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 384 events. 81/384 cut-off events. For 162/169 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1826 event pairs, 36 based on Foata normal form. 4/359 useless extension candidates. Maximal degree in co-relation 687. Up to 143 conditions per place. [2025-02-08 05:30:17,483 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 23 selfloop transitions, 7 changer transitions 0/89 dead transitions. [2025-02-08 05:30:17,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 89 transitions, 310 flow [2025-02-08 05:30:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2025-02-08 05:30:17,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2025-02-08 05:30:17,485 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 226 flow. Second operand 3 states and 228 transitions. [2025-02-08 05:30:17,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 89 transitions, 310 flow [2025-02-08 05:30:17,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 89 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:17,487 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 264 flow [2025-02-08 05:30:17,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2025-02-08 05:30:17,488 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2025-02-08 05:30:17,488 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 264 flow [2025-02-08 05:30:17,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-08 05:30:17,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:17,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:17,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:30:17,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:30:17,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:17,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1610516420, now seen corresponding path program 1 times [2025-02-08 05:30:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702122504] [2025-02-08 05:30:17,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:17,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:30:17,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:30:17,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:17,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702122504] [2025-02-08 05:30:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702122504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989988155] [2025-02-08 05:30:17,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:17,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:17,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:17,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:17,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2025-02-08 05:30:17,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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-02-08 05:30:17,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:17,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2025-02-08 05:30:17,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:17,628 INFO L124 PetriNetUnfolderBase]: 127/514 cut-off events. [2025-02-08 05:30:17,629 INFO L125 PetriNetUnfolderBase]: For 235/244 co-relation queries the response was YES. [2025-02-08 05:30:17,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 514 events. 127/514 cut-off events. For 235/244 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2661 event pairs, 45 based on Foata normal form. 5/473 useless extension candidates. Maximal degree in co-relation 991. Up to 198 conditions per place. [2025-02-08 05:30:17,636 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 26 selfloop transitions, 12 changer transitions 1/99 dead transitions. [2025-02-08 05:30:17,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 99 transitions, 386 flow [2025-02-08 05:30:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2025-02-08 05:30:17,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8598484848484849 [2025-02-08 05:30:17,637 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 264 flow. Second operand 3 states and 227 transitions. [2025-02-08 05:30:17,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 99 transitions, 386 flow [2025-02-08 05:30:17,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 99 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:17,640 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 348 flow [2025-02-08 05:30:17,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2025-02-08 05:30:17,641 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-02-08 05:30:17,641 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 95 transitions, 348 flow [2025-02-08 05:30:17,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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-02-08 05:30:17,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:17,641 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] [2025-02-08 05:30:17,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:30:17,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:30:17,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1614280674, now seen corresponding path program 1 times [2025-02-08 05:30:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:17,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153194053] [2025-02-08 05:30:17,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:17,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:30:17,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:30:17,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:17,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:17,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:17,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153194053] [2025-02-08 05:30:17,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153194053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:17,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:17,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:30:17,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809851698] [2025-02-08 05:30:17,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:17,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:17,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:17,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:17,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:17,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 88 [2025-02-08 05:30:17,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-02-08 05:30:17,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:17,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 88 [2025-02-08 05:30:17,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:17,823 INFO L124 PetriNetUnfolderBase]: 31/227 cut-off events. [2025-02-08 05:30:17,823 INFO L125 PetriNetUnfolderBase]: For 79/83 co-relation queries the response was YES. [2025-02-08 05:30:17,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 227 events. 31/227 cut-off events. For 79/83 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 845 event pairs, 4 based on Foata normal form. 2/214 useless extension candidates. Maximal degree in co-relation 377. Up to 36 conditions per place. [2025-02-08 05:30:17,824 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 4 selfloop transitions, 5 changer transitions 2/85 dead transitions. [2025-02-08 05:30:17,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 290 flow [2025-02-08 05:30:17,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-02-08 05:30:17,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9356060606060606 [2025-02-08 05:30:17,826 INFO L175 Difference]: Start difference. First operand has 83 places, 95 transitions, 348 flow. Second operand 3 states and 247 transitions. [2025-02-08 05:30:17,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 290 flow [2025-02-08 05:30:17,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 258 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 05:30:17,829 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 240 flow [2025-02-08 05:30:17,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2025-02-08 05:30:17,829 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2025-02-08 05:30:17,829 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 240 flow [2025-02-08 05:30:17,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-02-08 05:30:17,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:17,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:17,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:30:17,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:30:17,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1015560465, now seen corresponding path program 1 times [2025-02-08 05:30:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:17,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083718991] [2025-02-08 05:30:17,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:17,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:30:17,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:30:17,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:17,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:17,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083718991] [2025-02-08 05:30:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083718991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:17,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204441196] [2025-02-08 05:30:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:17,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:17,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:17,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:17,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2025-02-08 05:30:17,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-02-08 05:30:17,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:17,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2025-02-08 05:30:17,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:18,008 INFO L124 PetriNetUnfolderBase]: 69/303 cut-off events. [2025-02-08 05:30:18,009 INFO L125 PetriNetUnfolderBase]: For 146/150 co-relation queries the response was YES. [2025-02-08 05:30:18,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 303 events. 69/303 cut-off events. For 146/150 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1266 event pairs, 24 based on Foata normal form. 1/289 useless extension candidates. Maximal degree in co-relation 616. Up to 116 conditions per place. [2025-02-08 05:30:18,010 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 20 selfloop transitions, 7 changer transitions 6/89 dead transitions. [2025-02-08 05:30:18,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 89 transitions, 332 flow [2025-02-08 05:30:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:18,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2025-02-08 05:30:18,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8446969696969697 [2025-02-08 05:30:18,011 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 240 flow. Second operand 3 states and 223 transitions. [2025-02-08 05:30:18,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 89 transitions, 332 flow [2025-02-08 05:30:18,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 332 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:18,013 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 276 flow [2025-02-08 05:30:18,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2025-02-08 05:30:18,015 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-02-08 05:30:18,016 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 276 flow [2025-02-08 05:30:18,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-02-08 05:30:18,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:18,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:18,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:30:18,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:30:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash 852999210, now seen corresponding path program 1 times [2025-02-08 05:30:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000520998] [2025-02-08 05:30:18,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:18,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:30:18,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:30:18,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:18,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:30:18,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:30:18,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:30:18,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:30:18,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:18,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:30:18,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:30:18,080 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:30:18,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-08 05:30:18,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-08 05:30:18,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:30:18,083 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:30:18,111 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:30:18,111 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:30:18,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:30:18 BasicIcfg [2025-02-08 05:30:18,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:30:18,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:30:18,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:30:18,117 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:30:18,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:16" (3/4) ... [2025-02-08 05:30:18,118 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:30:18,165 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-02-08 05:30:18,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:30:18,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:30:18,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:30:18,192 INFO L158 Benchmark]: Toolchain (without parser) took 2228.21ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 92.1MB in the end (delta: 29.5MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2025-02-08 05:30:18,192 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:18,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.88ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 94.1MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:30:18,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.12ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 92.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:30:18,193 INFO L158 Benchmark]: Boogie Preprocessor took 22.75ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 90.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:18,193 INFO L158 Benchmark]: IcfgBuilder took 313.76ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 75.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:30:18,193 INFO L158 Benchmark]: TraceAbstraction took 1346.72ms. Allocated memory is still 167.8MB. Free memory was 74.7MB in the beginning and 101.0MB in the end (delta: -26.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:18,193 INFO L158 Benchmark]: Witness Printer took 74.53ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 92.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:30:18,194 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.29ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.88ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 94.1MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.12ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 92.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.75ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 90.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 313.76ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 75.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1346.72ms. Allocated memory is still 167.8MB. Free memory was 74.7MB in the beginning and 101.0MB in the end (delta: -26.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 74.53ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 92.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 924]: Data race detected Data race detected The following path leads to a data race: [L918] 0 int myglobal; VAL [myglobal=0] [L919] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, myglobal=0] [L920] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, mutex2={2:0}, myglobal=0] [L936] 0 pthread_t id; VAL [mutex1={1:0}, mutex2={2:0}, myglobal=0] [L937] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [id=-1, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L930] EXPR 1 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L930] 1 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L932] CALL 1 fun() [L922] 1 int i = __VERIFIER_nondet_int(); VAL [i=0, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L939] EXPR 0 myglobal+1 VAL [id=-1, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L924] 1 myglobal+1 VAL [i=0, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L939] 0 myglobal=myglobal+1 VAL [id=-1, mutex1={1:0}, mutex2={2:0}, myglobal=2] [L924] 1 myglobal+1 VAL [i=0, mutex1={1:0}, mutex2={2:0}, myglobal=2] Now there is a data race on ~myglobal~0 between C: myglobal=myglobal+1 [939] and C: myglobal+1 [924] - UnprovableResult [Line: 939]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 939]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 942]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 937]: 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: 930]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 924]: 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, 127 locations, 12 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: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 235 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 34 mSDtfsCounter, 235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:30:18,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)