./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_11-equ_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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 ../sv-benchmarks/c/goblint-regression/06-symbeq_11-equ_nr.i -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 071be118cd0932d66afa6bce30fcab76880adc6e53d2ca540223cce2e13054f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:57:34,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:57:34,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:57:34,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:57:34,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:57:34,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:57:34,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:57:34,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:57:34,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:57:34,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:57:34,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:57:34,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:57:34,813 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:57:34,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:57:34,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:57:34,813 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:57:34,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:57:34,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:57:34,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:57:34,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:57:34,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:34,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:57:34,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:57:34,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:57:34,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:57:34,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:57:34,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:57:34,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:57:34,815 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 -> 071be118cd0932d66afa6bce30fcab76880adc6e53d2ca540223cce2e13054f4 [2025-03-08 21:57:35,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:57:35,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:57:35,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:57:35,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:57:35,027 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:57:35,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_11-equ_nr.i [2025-03-08 21:57:36,169 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05f788d3/56362cff6bb54e8e95d9abcd904c6c0c/FLAG8c898e5f7 [2025-03-08 21:57:36,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:57:36,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_11-equ_nr.i [2025-03-08 21:57:36,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05f788d3/56362cff6bb54e8e95d9abcd904c6c0c/FLAG8c898e5f7 [2025-03-08 21:57:36,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05f788d3/56362cff6bb54e8e95d9abcd904c6c0c [2025-03-08 21:57:36,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:57:36,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:57:36,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:36,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:57:36,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:57:36,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:36,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610356d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36, skipping insertion in model container [2025-03-08 21:57:36,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:36,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:57:36,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:36,910 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:57:36,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:36,999 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:57:36,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36 WrapperNode [2025-03-08 21:57:37,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:37,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:37,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:57:37,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:57:37,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,033 INFO L138 Inliner]: procedures = 265, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2025-03-08 21:57:37,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:37,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:57:37,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:57:37,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:57:37,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:57:37,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:57:37,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:57:37,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:57:37,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (1/1) ... [2025-03-08 21:57:37,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:37,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:37,087 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-03-08 21:57:37,090 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-03-08 21:57:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:57:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:57:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:57:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:57:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:57:37,107 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:57:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:57:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:57:37,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:57:37,108 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:57:37,198 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:57:37,199 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:57:37,369 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:57:37,369 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:57:37,391 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:57:37,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:57:37,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:37 BoogieIcfgContainer [2025-03-08 21:57:37,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:57:37,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:57:37,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:57:37,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:57:37,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:57:36" (1/3) ... [2025-03-08 21:57:37,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6de18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:37, skipping insertion in model container [2025-03-08 21:57:37,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:36" (2/3) ... [2025-03-08 21:57:37,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6de18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:37, skipping insertion in model container [2025-03-08 21:57:37,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:37" (3/3) ... [2025-03-08 21:57:37,403 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_11-equ_nr.i [2025-03-08 21:57:37,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:57:37,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_11-equ_nr.i that has 2 procedures, 88 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-08 21:57:37,415 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:57:37,462 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:57:37,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 89 transitions, 182 flow [2025-03-08 21:57:37,542 INFO L124 PetriNetUnfolderBase]: 1/91 cut-off events. [2025-03-08 21:57:37,544 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 1/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-08 21:57:37,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 89 transitions, 182 flow [2025-03-08 21:57:37,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 86 transitions, 175 flow [2025-03-08 21:57:37,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:57:37,568 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;@7c1d44c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:57:37,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 21:57:37,588 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:57:37,588 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2025-03-08 21:57:37,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:37,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:37,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:37,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-08 21:57:37,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1635534736, now seen corresponding path program 1 times [2025-03-08 21:57:37,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:37,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401818052] [2025-03-08 21:57:37,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:37,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 21:57:37,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 21:57:37,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:37,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:38,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:38,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401818052] [2025-03-08 21:57:38,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401818052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:38,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:38,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472935905] [2025-03-08 21:57:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:38,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:38,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:38,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:38,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 89 [2025-03-08 21:57:38,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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-03-08 21:57:38,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:38,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 89 [2025-03-08 21:57:38,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:38,580 INFO L124 PetriNetUnfolderBase]: 79/333 cut-off events. [2025-03-08 21:57:38,580 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:38,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 333 events. 79/333 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1423 event pairs, 25 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 459. Up to 130 conditions per place. [2025-03-08 21:57:38,584 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 21 selfloop transitions, 22 changer transitions 4/115 dead transitions. [2025-03-08 21:57:38,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 327 flow [2025-03-08 21:57:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2025-03-08 21:57:38,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8876404494382022 [2025-03-08 21:57:38,597 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 175 flow. Second operand 6 states and 474 transitions. [2025-03-08 21:57:38,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 327 flow [2025-03-08 21:57:38,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 115 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:38,604 INFO L231 Difference]: Finished difference. Result has 98 places, 107 transitions, 324 flow [2025-03-08 21:57:38,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=98, PETRI_TRANSITIONS=107} [2025-03-08 21:57:38,609 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 9 predicate places. [2025-03-08 21:57:38,611 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 324 flow [2025-03-08 21:57:38,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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-03-08 21:57:38,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:38,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:38,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:57:38,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-08 21:57:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash -523393511, now seen corresponding path program 1 times [2025-03-08 21:57:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:38,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045808137] [2025-03-08 21:57:38,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:38,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:38,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 21:57:38,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 21:57:38,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:38,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:38,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:38,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045808137] [2025-03-08 21:57:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045808137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:38,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:38,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:38,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801695434] [2025-03-08 21:57:38,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:38,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:38,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:38,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:38,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2025-03-08 21:57:38,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 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-03-08 21:57:38,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:38,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2025-03-08 21:57:38,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:39,025 INFO L124 PetriNetUnfolderBase]: 132/466 cut-off events. [2025-03-08 21:57:39,025 INFO L125 PetriNetUnfolderBase]: For 136/144 co-relation queries the response was YES. [2025-03-08 21:57:39,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 466 events. 132/466 cut-off events. For 136/144 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2210 event pairs, 31 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 995. Up to 218 conditions per place. [2025-03-08 21:57:39,028 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 39 selfloop transitions, 29 changer transitions 7/142 dead transitions. [2025-03-08 21:57:39,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 142 transitions, 614 flow [2025-03-08 21:57:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 459 transitions. [2025-03-08 21:57:39,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595505617977528 [2025-03-08 21:57:39,031 INFO L175 Difference]: Start difference. First operand has 98 places, 107 transitions, 324 flow. Second operand 6 states and 459 transitions. [2025-03-08 21:57:39,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 142 transitions, 614 flow [2025-03-08 21:57:39,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 142 transitions, 614 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:39,039 INFO L231 Difference]: Finished difference. Result has 108 places, 131 transitions, 578 flow [2025-03-08 21:57:39,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=108, PETRI_TRANSITIONS=131} [2025-03-08 21:57:39,040 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 19 predicate places. [2025-03-08 21:57:39,040 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 578 flow [2025-03-08 21:57:39,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 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-03-08 21:57:39,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:39,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:39,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:57:39,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-08 21:57:39,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1668552632, now seen corresponding path program 1 times [2025-03-08 21:57:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:39,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587180358] [2025-03-08 21:57:39,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:39,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 21:57:39,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 21:57:39,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:39,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587180358] [2025-03-08 21:57:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587180358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:39,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:57:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409184261] [2025-03-08 21:57:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:39,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:57:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:39,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:57:39,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:57:39,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 89 [2025-03-08 21:57:39,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 578 flow. Second operand has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 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-03-08 21:57:39,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:39,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 89 [2025-03-08 21:57:39,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:39,595 INFO L124 PetriNetUnfolderBase]: 88/440 cut-off events. [2025-03-08 21:57:39,596 INFO L125 PetriNetUnfolderBase]: For 187/192 co-relation queries the response was YES. [2025-03-08 21:57:39,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 440 events. 88/440 cut-off events. For 187/192 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2204 event pairs, 5 based on Foata normal form. 2/439 useless extension candidates. Maximal degree in co-relation 847. Up to 86 conditions per place. [2025-03-08 21:57:39,599 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 11 selfloop transitions, 4 changer transitions 16/143 dead transitions. [2025-03-08 21:57:39,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 143 transitions, 658 flow [2025-03-08 21:57:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:57:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 21:57:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 547 transitions. [2025-03-08 21:57:39,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8780096308186196 [2025-03-08 21:57:39,600 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 578 flow. Second operand 7 states and 547 transitions. [2025-03-08 21:57:39,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 143 transitions, 658 flow [2025-03-08 21:57:39,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 143 transitions, 640 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:39,610 INFO L231 Difference]: Finished difference. Result has 117 places, 126 transitions, 568 flow [2025-03-08 21:57:39,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=568, PETRI_PLACES=117, PETRI_TRANSITIONS=126} [2025-03-08 21:57:39,612 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 28 predicate places. [2025-03-08 21:57:39,612 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 126 transitions, 568 flow [2025-03-08 21:57:39,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 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-03-08 21:57:39,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:39,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:39,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:57:39,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-08 21:57:39,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash 216125896, now seen corresponding path program 1 times [2025-03-08 21:57:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:39,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699414132] [2025-03-08 21:57:39,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:39,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 21:57:39,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 21:57:39,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:39,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:40,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:40,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699414132] [2025-03-08 21:57:40,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699414132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:40,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:40,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:57:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509374256] [2025-03-08 21:57:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:40,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:57:40,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:40,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:57:40,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:57:40,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-03-08 21:57:40,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 126 transitions, 568 flow. Second operand has 11 states, 11 states have (on average 64.54545454545455) internal successors, (710), 11 states have internal predecessors, (710), 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-03-08 21:57:40,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:40,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-03-08 21:57:40,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:40,714 INFO L124 PetriNetUnfolderBase]: 129/445 cut-off events. [2025-03-08 21:57:40,714 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2025-03-08 21:57:40,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 445 events. 129/445 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2114 event pairs, 22 based on Foata normal form. 11/452 useless extension candidates. Maximal degree in co-relation 1320. Up to 89 conditions per place. [2025-03-08 21:57:40,717 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 62 selfloop transitions, 32 changer transitions 23/175 dead transitions. [2025-03-08 21:57:40,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 175 transitions, 1110 flow [2025-03-08 21:57:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:57:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 21:57:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 756 transitions. [2025-03-08 21:57:40,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7722165474974464 [2025-03-08 21:57:40,724 INFO L175 Difference]: Start difference. First operand has 117 places, 126 transitions, 568 flow. Second operand 11 states and 756 transitions. [2025-03-08 21:57:40,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 175 transitions, 1110 flow [2025-03-08 21:57:40,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 175 transitions, 1059 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-08 21:57:40,731 INFO L231 Difference]: Finished difference. Result has 121 places, 127 transitions, 664 flow [2025-03-08 21:57:40,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=664, PETRI_PLACES=121, PETRI_TRANSITIONS=127} [2025-03-08 21:57:40,732 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 32 predicate places. [2025-03-08 21:57:40,733 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 127 transitions, 664 flow [2025-03-08 21:57:40,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.54545454545455) internal successors, (710), 11 states have internal predecessors, (710), 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-03-08 21:57:40,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:40,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:40,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:57:40,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-08 21:57:40,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash 751490182, now seen corresponding path program 1 times [2025-03-08 21:57:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:40,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618634802] [2025-03-08 21:57:40,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:40,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 21:57:40,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 21:57:40,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:40,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:41,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:41,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618634802] [2025-03-08 21:57:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618634802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:41,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:57:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449877341] [2025-03-08 21:57:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:41,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:57:41,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:41,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:57:41,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:57:41,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-03-08 21:57:41,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 127 transitions, 664 flow. Second operand has 11 states, 11 states have (on average 64.54545454545455) internal successors, (710), 11 states have internal predecessors, (710), 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-03-08 21:57:41,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:41,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-03-08 21:57:41,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:41,705 INFO L124 PetriNetUnfolderBase]: 105/385 cut-off events. [2025-03-08 21:57:41,705 INFO L125 PetriNetUnfolderBase]: For 620/646 co-relation queries the response was YES. [2025-03-08 21:57:41,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 385 events. 105/385 cut-off events. For 620/646 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1698 event pairs, 20 based on Foata normal form. 16/398 useless extension candidates. Maximal degree in co-relation 1308. Up to 82 conditions per place. [2025-03-08 21:57:41,707 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 45 selfloop transitions, 28 changer transitions 33/157 dead transitions. [2025-03-08 21:57:41,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 157 transitions, 1136 flow [2025-03-08 21:57:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:57:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 21:57:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 682 transitions. [2025-03-08 21:57:41,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7662921348314606 [2025-03-08 21:57:41,710 INFO L175 Difference]: Start difference. First operand has 121 places, 127 transitions, 664 flow. Second operand 10 states and 682 transitions. [2025-03-08 21:57:41,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 157 transitions, 1136 flow [2025-03-08 21:57:41,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 157 transitions, 1086 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-08 21:57:41,716 INFO L231 Difference]: Finished difference. Result has 121 places, 108 transitions, 551 flow [2025-03-08 21:57:41,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=551, PETRI_PLACES=121, PETRI_TRANSITIONS=108} [2025-03-08 21:57:41,717 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 32 predicate places. [2025-03-08 21:57:41,717 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 108 transitions, 551 flow [2025-03-08 21:57:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.54545454545455) internal successors, (710), 11 states have internal predecessors, (710), 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-03-08 21:57:41,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:41,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:41,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:57:41,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-08 21:57:41,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:41,719 INFO L85 PathProgramCache]: Analyzing trace with hash 503629162, now seen corresponding path program 1 times [2025-03-08 21:57:41,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:41,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-03-08 21:57:41,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:41,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:41,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 21:57:41,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 21:57:41,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:41,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:42,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:42,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-03-08 21:57:42,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892007589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:42,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:42,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:57:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177439662] [2025-03-08 21:57:42,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:42,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:57:42,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:42,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:57:42,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:57:42,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-03-08 21:57:42,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 108 transitions, 551 flow. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-03-08 21:57:42,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:42,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-03-08 21:57:42,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:42,775 INFO L124 PetriNetUnfolderBase]: 49/218 cut-off events. [2025-03-08 21:57:42,775 INFO L125 PetriNetUnfolderBase]: For 417/426 co-relation queries the response was YES. [2025-03-08 21:57:42,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 218 events. 49/218 cut-off events. For 417/426 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 661 event pairs, 11 based on Foata normal form. 10/225 useless extension candidates. Maximal degree in co-relation 745. Up to 40 conditions per place. [2025-03-08 21:57:42,777 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 37 selfloop transitions, 17 changer transitions 21/129 dead transitions. [2025-03-08 21:57:42,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 129 transitions, 836 flow [2025-03-08 21:57:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:57:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 21:57:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 739 transitions. [2025-03-08 21:57:42,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7548518896833504 [2025-03-08 21:57:42,780 INFO L175 Difference]: Start difference. First operand has 121 places, 108 transitions, 551 flow. Second operand 11 states and 739 transitions. [2025-03-08 21:57:42,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 129 transitions, 836 flow [2025-03-08 21:57:42,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 129 transitions, 721 flow, removed 5 selfloop flow, removed 12 redundant places. [2025-03-08 21:57:42,786 INFO L231 Difference]: Finished difference. Result has 114 places, 98 transitions, 424 flow [2025-03-08 21:57:42,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=424, PETRI_PLACES=114, PETRI_TRANSITIONS=98} [2025-03-08 21:57:42,787 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 25 predicate places. [2025-03-08 21:57:42,787 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 98 transitions, 424 flow [2025-03-08 21:57:42,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-03-08 21:57:42,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:42,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:42,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:57:42,789 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-08 21:57:42,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1265806978, now seen corresponding path program 2 times [2025-03-08 21:57:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:42,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120391214] [2025-03-08 21:57:42,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:42,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 1 equivalence classes. [2025-03-08 21:57:42,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 21:57:42,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:42,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:43,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120391214] [2025-03-08 21:57:43,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120391214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:43,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:43,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:57:43,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526775245] [2025-03-08 21:57:43,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:43,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:57:43,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:43,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:57:43,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:57:43,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-03-08 21:57:43,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 98 transitions, 424 flow. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-03-08 21:57:43,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:43,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-03-08 21:57:43,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:43,595 INFO L124 PetriNetUnfolderBase]: 36/189 cut-off events. [2025-03-08 21:57:43,596 INFO L125 PetriNetUnfolderBase]: For 367/372 co-relation queries the response was YES. [2025-03-08 21:57:43,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 189 events. 36/189 cut-off events. For 367/372 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 507 event pairs, 11 based on Foata normal form. 6/192 useless extension candidates. Maximal degree in co-relation 585. Up to 36 conditions per place. [2025-03-08 21:57:43,598 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 25 selfloop transitions, 9 changer transitions 29/116 dead transitions. [2025-03-08 21:57:43,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 645 flow [2025-03-08 21:57:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 21:57:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 21:57:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 800 transitions. [2025-03-08 21:57:43,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7490636704119851 [2025-03-08 21:57:43,600 INFO L175 Difference]: Start difference. First operand has 114 places, 98 transitions, 424 flow. Second operand 12 states and 800 transitions. [2025-03-08 21:57:43,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 645 flow [2025-03-08 21:57:43,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 116 transitions, 602 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-03-08 21:57:43,605 INFO L231 Difference]: Finished difference. Result has 115 places, 84 transitions, 300 flow [2025-03-08 21:57:43,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=300, PETRI_PLACES=115, PETRI_TRANSITIONS=84} [2025-03-08 21:57:43,606 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 26 predicate places. [2025-03-08 21:57:43,607 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 84 transitions, 300 flow [2025-03-08 21:57:43,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-03-08 21:57:43,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:43,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:43,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:57:43,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-08 21:57:43,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1394392380, now seen corresponding path program 3 times [2025-03-08 21:57:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:43,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441886070] [2025-03-08 21:57:43,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:57:43,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:43,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 1 equivalence classes. [2025-03-08 21:57:43,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 21:57:43,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:57:43,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441886070] [2025-03-08 21:57:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441886070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:43,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:57:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20284554] [2025-03-08 21:57:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:43,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:57:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:43,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:57:43,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:57:44,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-03-08 21:57:44,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 84 transitions, 300 flow. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-03-08 21:57:44,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:44,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-03-08 21:57:44,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:44,305 INFO L124 PetriNetUnfolderBase]: 16/132 cut-off events. [2025-03-08 21:57:44,305 INFO L125 PetriNetUnfolderBase]: For 142/143 co-relation queries the response was YES. [2025-03-08 21:57:44,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 132 events. 16/132 cut-off events. For 142/143 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 250 event pairs, 11 based on Foata normal form. 2/131 useless extension candidates. Maximal degree in co-relation 312. Up to 32 conditions per place. [2025-03-08 21:57:44,306 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 0 selfloop transitions, 0 changer transitions 88/88 dead transitions. [2025-03-08 21:57:44,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 88 transitions, 389 flow [2025-03-08 21:57:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:57:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 21:57:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 721 transitions. [2025-03-08 21:57:44,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7364657814096016 [2025-03-08 21:57:44,307 INFO L175 Difference]: Start difference. First operand has 115 places, 84 transitions, 300 flow. Second operand 11 states and 721 transitions. [2025-03-08 21:57:44,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 88 transitions, 389 flow [2025-03-08 21:57:44,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 88 transitions, 344 flow, removed 7 selfloop flow, removed 14 redundant places. [2025-03-08 21:57:44,309 INFO L231 Difference]: Finished difference. Result has 101 places, 0 transitions, 0 flow [2025-03-08 21:57:44,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=101, PETRI_TRANSITIONS=0} [2025-03-08 21:57:44,310 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 12 predicate places. [2025-03-08 21:57:44,310 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 0 transitions, 0 flow [2025-03-08 21:57:44,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-03-08 21:57:44,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2025-03-08 21:57:44,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-08 21:57:44,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2025-03-08 21:57:44,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2025-03-08 21:57:44,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:57:44,314 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-03-08 21:57:44,323 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:57:44,323 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:57:44,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:57:44 BasicIcfg [2025-03-08 21:57:44,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:57:44,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:57:44,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:57:44,327 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:57:44,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:37" (3/4) ... [2025-03-08 21:57:44,329 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 21:57:44,331 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-08 21:57:44,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 21:57:44,334 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:57:44,334 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:57:44,390 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:57:44,390 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:57:44,390 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:57:44,391 INFO L158 Benchmark]: Toolchain (without parser) took 7875.60ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 110.7MB in the beginning and 94.1MB in the end (delta: 16.5MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2025-03-08 21:57:44,391 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 226.5MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:44,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.32ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 82.9MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 21:57:44,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.56ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:57:44,394 INFO L158 Benchmark]: Boogie Preprocessor took 20.96ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:44,394 INFO L158 Benchmark]: IcfgBuilder took 336.80ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 64.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:57:44,394 INFO L158 Benchmark]: TraceAbstraction took 6929.84ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 63.6MB in the beginning and 100.0MB in the end (delta: -36.4MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2025-03-08 21:57:44,394 INFO L158 Benchmark]: Witness Printer took 62.85ms. Allocated memory is still 234.9MB. Free memory was 100.0MB in the beginning and 94.1MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:44,395 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.25ms. Allocated memory is still 226.5MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.32ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 82.9MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.56ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.96ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 336.80ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 64.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6929.84ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 63.6MB in the beginning and 100.0MB in the end (delta: -36.4MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. * Witness Printer took 62.85ms. Allocated memory is still 234.9MB. Free memory was 100.0MB in the beginning and 94.1MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1022]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 996]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 106 locations, 106 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1924 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1565 mSDsluCounter, 1986 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1845 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5179 IncrementalHoareTripleChecker+Invalid, 5290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 141 mSDtfsCounter, 5179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=4, InterpolantAutomatonStates: 74, 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, 2.6s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 513 ConstructedInterpolants, 0 QuantifiedInterpolants, 3089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 21:57:44,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE