./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/pthread/stack-1.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 a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:42:17,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:42:17,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:42:17,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:42:17,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:42:17,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:42:17,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:42:17,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:42:17,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:42:17,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:42:17,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:42:17,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:42:17,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:42:17,223 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:42:17,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:42:17,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:42:17,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:42:17,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:42:17,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:42:17,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:42:17,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:42:17,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:42:17,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:42:17,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:42:17,225 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2025-03-17 10:42:17,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:42:17,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:42:17,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:42:17,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:42:17,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:42:17,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-1.i [2025-03-17 10:42:18,640 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a960286/e168b6e2662e45769f1bdffb740c2380/FLAG3ee33d36a [2025-03-17 10:42:18,924 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:42:18,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-1.i [2025-03-17 10:42:18,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a960286/e168b6e2662e45769f1bdffb740c2380/FLAG3ee33d36a [2025-03-17 10:42:18,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a960286/e168b6e2662e45769f1bdffb740c2380 [2025-03-17 10:42:18,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:42:18,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:42:18,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:42:18,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:42:18,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:42:18,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:42:18" (1/1) ... [2025-03-17 10:42:18,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537612f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:18, skipping insertion in model container [2025-03-17 10:42:18,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:42:18" (1/1) ... [2025-03-17 10:42:18,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:42:19,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:42:19,335 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:42:19,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:42:19,418 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:42:19,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19 WrapperNode [2025-03-17 10:42:19,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:42:19,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:42:19,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:42:19,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:42:19,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,462 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 182 [2025-03-17 10:42:19,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:42:19,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:42:19,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:42:19,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:42:19,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:42:19,486 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:42:19,486 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:42:19,486 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:42:19,487 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (1/1) ... [2025-03-17 10:42:19,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:42:19,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:42:19,515 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-17 10:42:19,518 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-17 10:42:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 10:42:19,534 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 10:42:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 10:42:19,534 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 10:42:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:42:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:42:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:42:19,535 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:42:19,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:42:19,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:42:19,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:42:19,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:42:19,536 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:42:19,630 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:42:19,631 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:42:19,875 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-03-17 10:42:19,875 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem40#1; [2025-03-17 10:42:19,875 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret39#1; [2025-03-17 10:42:19,876 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:42:19,876 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:42:19,897 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:42:19,897 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:42:19,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:19 BoogieIcfgContainer [2025-03-17 10:42:19,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:42:19,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:42:19,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:42:19,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:42:19,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:42:18" (1/3) ... [2025-03-17 10:42:19,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0f167f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:42:19, skipping insertion in model container [2025-03-17 10:42:19,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:19" (2/3) ... [2025-03-17 10:42:19,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0f167f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:42:19, skipping insertion in model container [2025-03-17 10:42:19,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:19" (3/3) ... [2025-03-17 10:42:19,907 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-1.i [2025-03-17 10:42:19,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:42:19,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-1.i that has 3 procedures, 197 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-03-17 10:42:19,920 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:42:20,016 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 10:42:20,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 206 transitions, 426 flow [2025-03-17 10:42:20,138 INFO L124 PetriNetUnfolderBase]: 10/204 cut-off events. [2025-03-17 10:42:20,142 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:42:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 204 events. 10/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 493 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2025-03-17 10:42:20,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 206 transitions, 426 flow [2025-03-17 10:42:20,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 199 transitions, 407 flow [2025-03-17 10:42:20,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:42:20,170 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;@7222322e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:42:20,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-17 10:42:20,186 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:42:20,187 INFO L124 PetriNetUnfolderBase]: 0/66 cut-off events. [2025-03-17 10:42:20,188 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:42:20,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:20,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:20,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:20,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:20,194 INFO L85 PathProgramCache]: Analyzing trace with hash -837456586, now seen corresponding path program 1 times [2025-03-17 10:42:20,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:20,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818336695] [2025-03-17 10:42:20,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:20,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 10:42:20,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 10:42:20,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:20,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:20,421 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-17 10:42:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:20,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818336695] [2025-03-17 10:42:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818336695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:20,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:20,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682214919] [2025-03-17 10:42:20,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:20,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:20,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:20,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 206 [2025-03-17 10:42:20,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 199 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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-17 10:42:20,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:20,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 206 [2025-03-17 10:42:20,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:20,852 INFO L124 PetriNetUnfolderBase]: 270/2306 cut-off events. [2025-03-17 10:42:20,852 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-17 10:42:20,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2914 conditions, 2306 events. 270/2306 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 16420 event pairs, 77 based on Foata normal form. 148/2226 useless extension candidates. Maximal degree in co-relation 2642. Up to 405 conditions per place. [2025-03-17 10:42:20,871 INFO L140 encePairwiseOnDemand]: 178/206 looper letters, 36 selfloop transitions, 16 changer transitions 0/212 dead transitions. [2025-03-17 10:42:20,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 212 transitions, 543 flow [2025-03-17 10:42:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2025-03-17 10:42:20,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271844660194175 [2025-03-17 10:42:20,887 INFO L175 Difference]: Start difference. First operand has 196 places, 199 transitions, 407 flow. Second operand 3 states and 573 transitions. [2025-03-17 10:42:20,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 212 transitions, 543 flow [2025-03-17 10:42:20,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 212 transitions, 535 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 10:42:20,899 INFO L231 Difference]: Finished difference. Result has 193 places, 206 transitions, 526 flow [2025-03-17 10:42:20,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=193, PETRI_TRANSITIONS=206} [2025-03-17 10:42:20,905 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -3 predicate places. [2025-03-17 10:42:20,905 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 206 transitions, 526 flow [2025-03-17 10:42:20,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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-17 10:42:20,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:20,906 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] [2025-03-17 10:42:20,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:42:20,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:20,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:20,907 INFO L85 PathProgramCache]: Analyzing trace with hash -112647543, now seen corresponding path program 1 times [2025-03-17 10:42:20,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:20,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767539506] [2025-03-17 10:42:20,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:20,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:20,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 10:42:20,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 10:42:20,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:20,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:21,081 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-17 10:42:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:21,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767539506] [2025-03-17 10:42:21,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767539506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:21,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:21,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:42:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231483015] [2025-03-17 10:42:21,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:21,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:21,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:21,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:21,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:21,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 206 [2025-03-17 10:42:21,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 206 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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-17 10:42:21,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:21,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 206 [2025-03-17 10:42:21,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:21,382 INFO L124 PetriNetUnfolderBase]: 287/2967 cut-off events. [2025-03-17 10:42:21,382 INFO L125 PetriNetUnfolderBase]: For 123/125 co-relation queries the response was YES. [2025-03-17 10:42:21,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 2967 events. 287/2967 cut-off events. For 123/125 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 22513 event pairs, 68 based on Foata normal form. 21/2728 useless extension candidates. Maximal degree in co-relation 3538. Up to 338 conditions per place. [2025-03-17 10:42:21,393 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 18 selfloop transitions, 3 changer transitions 0/213 dead transitions. [2025-03-17 10:42:21,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 213 transitions, 585 flow [2025-03-17 10:42:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 575 transitions. [2025-03-17 10:42:21,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.93042071197411 [2025-03-17 10:42:21,397 INFO L175 Difference]: Start difference. First operand has 193 places, 206 transitions, 526 flow. Second operand 3 states and 575 transitions. [2025-03-17 10:42:21,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 213 transitions, 585 flow [2025-03-17 10:42:21,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 213 transitions, 553 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:21,404 INFO L231 Difference]: Finished difference. Result has 194 places, 207 transitions, 511 flow [2025-03-17 10:42:21,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=511, PETRI_PLACES=194, PETRI_TRANSITIONS=207} [2025-03-17 10:42:21,406 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -2 predicate places. [2025-03-17 10:42:21,406 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 207 transitions, 511 flow [2025-03-17 10:42:21,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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-17 10:42:21,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:21,407 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] [2025-03-17 10:42:21,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:42:21,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:21,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash -503121709, now seen corresponding path program 1 times [2025-03-17 10:42:21,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:21,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167075744] [2025-03-17 10:42:21,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:21,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:42:21,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:42:21,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:21,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:21,850 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-17 10:42:21,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167075744] [2025-03-17 10:42:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167075744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:21,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:21,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:21,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735355499] [2025-03-17 10:42:21,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:21,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:21,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:21,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:21,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:21,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 206 [2025-03-17 10:42:21,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 207 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 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-17 10:42:21,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:21,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 206 [2025-03-17 10:42:21,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:22,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][72], [211#true, Black: 206#true, Black: 213#(= ~top~0 0), 93#L1014true, 105#L960true, 215#true, 89#L1023-1true, 204#true]) [2025-03-17 10:42:22,366 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-17 10:42:22,367 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-17 10:42:22,367 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-17 10:42:22,367 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-17 10:42:22,368 INFO L124 PetriNetUnfolderBase]: 556/4140 cut-off events. [2025-03-17 10:42:22,368 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-17 10:42:22,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5718 conditions, 4140 events. 556/4140 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 33421 event pairs, 210 based on Foata normal form. 0/3798 useless extension candidates. Maximal degree in co-relation 5247. Up to 768 conditions per place. [2025-03-17 10:42:22,383 INFO L140 encePairwiseOnDemand]: 195/206 looper letters, 35 selfloop transitions, 22 changer transitions 0/240 dead transitions. [2025-03-17 10:42:22,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 240 transitions, 699 flow [2025-03-17 10:42:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:42:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:42:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1102 transitions. [2025-03-17 10:42:22,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8915857605177994 [2025-03-17 10:42:22,388 INFO L175 Difference]: Start difference. First operand has 194 places, 207 transitions, 511 flow. Second operand 6 states and 1102 transitions. [2025-03-17 10:42:22,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 240 transitions, 699 flow [2025-03-17 10:42:22,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 240 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:22,396 INFO L231 Difference]: Finished difference. Result has 203 places, 228 transitions, 658 flow [2025-03-17 10:42:22,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=203, PETRI_TRANSITIONS=228} [2025-03-17 10:42:22,398 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 7 predicate places. [2025-03-17 10:42:22,398 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 228 transitions, 658 flow [2025-03-17 10:42:22,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 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-17 10:42:22,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:22,399 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, 1, 1, 1, 1, 1] [2025-03-17 10:42:22,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:42:22,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:22,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash -563787111, now seen corresponding path program 1 times [2025-03-17 10:42:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:22,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250686180] [2025-03-17 10:42:22,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:22,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:22,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 10:42:22,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 10:42:22,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:22,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:22,450 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-17 10:42:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250686180] [2025-03-17 10:42:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250686180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:22,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:22,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023887924] [2025-03-17 10:42:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:22,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:22,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:22,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:22,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:22,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 206 [2025-03-17 10:42:22,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 228 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-17 10:42:22,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:22,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 206 [2025-03-17 10:42:22,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:22,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][72], [Black: 219#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 217#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 206#true, 59#L999true, Black: 213#(= ~top~0 0), 93#L1014true, 226#true, 215#true, Black: 220#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 204#true, Black: 218#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 89#L1023-1true]) [2025-03-17 10:42:22,709 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-17 10:42:22,709 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-17 10:42:22,709 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-17 10:42:22,709 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-17 10:42:22,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][72], [Black: 219#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 217#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 206#true, 147#L994true, Black: 213#(= ~top~0 0), 93#L1014true, 226#true, 215#true, Black: 220#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 204#true, Black: 218#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 89#L1023-1true]) [2025-03-17 10:42:22,730 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-17 10:42:22,730 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 10:42:22,730 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-17 10:42:22,730 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 10:42:22,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][72], [Black: 219#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 217#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 206#true, Black: 213#(= ~top~0 0), 93#L1014true, 215#true, 226#true, Black: 220#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 204#true, 92#L1025true, Black: 218#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|))]) [2025-03-17 10:42:22,739 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-17 10:42:22,739 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-17 10:42:22,739 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-17 10:42:22,739 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-17 10:42:22,840 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([531] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][72], [Black: 219#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 217#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 206#true, 59#L999true, Black: 213#(= ~top~0 0), 93#L1014true, 226#true, 215#true, Black: 220#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 204#true, Black: 218#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 89#L1023-1true]) [2025-03-17 10:42:22,840 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2025-03-17 10:42:22,840 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-17 10:42:22,840 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-17 10:42:22,840 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-17 10:42:22,840 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-17 10:42:22,852 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([531] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][72], [Black: 219#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 217#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 206#true, 147#L994true, Black: 213#(= ~top~0 0), 93#L1014true, 215#true, 226#true, Black: 220#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 204#true, Black: 218#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 89#L1023-1true]) [2025-03-17 10:42:22,852 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-17 10:42:22,852 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 10:42:22,852 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-17 10:42:22,853 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-17 10:42:22,853 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 10:42:22,860 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([531] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][72], [Black: 219#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 217#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 206#true, Black: 213#(= ~top~0 0), 93#L1014true, 215#true, 226#true, Black: 220#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 204#true, Black: 218#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 92#L1025true]) [2025-03-17 10:42:22,860 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2025-03-17 10:42:22,860 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-17 10:42:22,860 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-17 10:42:22,861 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-17 10:42:22,861 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-17 10:42:22,865 INFO L124 PetriNetUnfolderBase]: 515/4152 cut-off events. [2025-03-17 10:42:22,866 INFO L125 PetriNetUnfolderBase]: For 387/461 co-relation queries the response was YES. [2025-03-17 10:42:22,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6084 conditions, 4152 events. 515/4152 cut-off events. For 387/461 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 33236 event pairs, 164 based on Foata normal form. 15/3847 useless extension candidates. Maximal degree in co-relation 4713. Up to 776 conditions per place. [2025-03-17 10:42:22,884 INFO L140 encePairwiseOnDemand]: 197/206 looper letters, 32 selfloop transitions, 13 changer transitions 0/242 dead transitions. [2025-03-17 10:42:22,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 242 transitions, 796 flow [2025-03-17 10:42:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2025-03-17 10:42:22,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9077669902912622 [2025-03-17 10:42:22,887 INFO L175 Difference]: Start difference. First operand has 203 places, 228 transitions, 658 flow. Second operand 3 states and 561 transitions. [2025-03-17 10:42:22,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 242 transitions, 796 flow [2025-03-17 10:42:22,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 242 transitions, 796 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:22,893 INFO L231 Difference]: Finished difference. Result has 207 places, 239 transitions, 774 flow [2025-03-17 10:42:22,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=207, PETRI_TRANSITIONS=239} [2025-03-17 10:42:22,894 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 11 predicate places. [2025-03-17 10:42:22,894 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 239 transitions, 774 flow [2025-03-17 10:42:22,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-17 10:42:22,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:22,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:22,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:42:22,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:22,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1448848045, now seen corresponding path program 1 times [2025-03-17 10:42:22,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:22,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027400034] [2025-03-17 10:42:22,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:22,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 10:42:22,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 10:42:22,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:22,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:22,986 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-17 10:42:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027400034] [2025-03-17 10:42:22,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027400034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:22,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:22,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:42:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124187523] [2025-03-17 10:42:22,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:22,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:22,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:22,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:22,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:22,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 206 [2025-03-17 10:42:22,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 239 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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-17 10:42:22,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:22,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 206 [2025-03-17 10:42:22,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:23,067 INFO L124 PetriNetUnfolderBase]: 32/699 cut-off events. [2025-03-17 10:42:23,068 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-17 10:42:23,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 699 events. 32/699 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3022 event pairs, 5 based on Foata normal form. 10/676 useless extension candidates. Maximal degree in co-relation 576. Up to 65 conditions per place. [2025-03-17 10:42:23,070 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 7 selfloop transitions, 4 changer transitions 0/186 dead transitions. [2025-03-17 10:42:23,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 186 transitions, 501 flow [2025-03-17 10:42:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2025-03-17 10:42:23,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9385113268608414 [2025-03-17 10:42:23,072 INFO L175 Difference]: Start difference. First operand has 207 places, 239 transitions, 774 flow. Second operand 3 states and 580 transitions. [2025-03-17 10:42:23,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 186 transitions, 501 flow [2025-03-17 10:42:23,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 186 transitions, 427 flow, removed 23 selfloop flow, removed 14 redundant places. [2025-03-17 10:42:23,075 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 406 flow [2025-03-17 10:42:23,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2025-03-17 10:42:23,076 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -10 predicate places. [2025-03-17 10:42:23,076 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 406 flow [2025-03-17 10:42:23,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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-17 10:42:23,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:23,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:42:23,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:42:23,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:23,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash -930443120, now seen corresponding path program 1 times [2025-03-17 10:42:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:23,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082590577] [2025-03-17 10:42:23,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:23,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 10:42:23,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 10:42:23,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:23,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:23,124 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-17 10:42:23,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:23,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082590577] [2025-03-17 10:42:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082590577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:23,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:23,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609119492] [2025-03-17 10:42:23,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:23,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:23,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:23,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:23,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:23,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 206 [2025-03-17 10:42:23,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-17 10:42:23,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:23,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 206 [2025-03-17 10:42:23,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:23,200 INFO L124 PetriNetUnfolderBase]: 50/685 cut-off events. [2025-03-17 10:42:23,201 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-17 10:42:23,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 685 events. 50/685 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3158 event pairs, 28 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 343. Up to 117 conditions per place. [2025-03-17 10:42:23,203 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 22 selfloop transitions, 2 changer transitions 5/184 dead transitions. [2025-03-17 10:42:23,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 184 transitions, 455 flow [2025-03-17 10:42:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2025-03-17 10:42:23,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8915857605177994 [2025-03-17 10:42:23,205 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 406 flow. Second operand 3 states and 551 transitions. [2025-03-17 10:42:23,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 184 transitions, 455 flow [2025-03-17 10:42:23,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 184 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:23,207 INFO L231 Difference]: Finished difference. Result has 186 places, 178 transitions, 394 flow [2025-03-17 10:42:23,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=186, PETRI_TRANSITIONS=178} [2025-03-17 10:42:23,208 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -10 predicate places. [2025-03-17 10:42:23,208 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 178 transitions, 394 flow [2025-03-17 10:42:23,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-17 10:42:23,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:23,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:42:23,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:42:23,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:23,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1563779090, now seen corresponding path program 1 times [2025-03-17 10:42:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:23,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749184517] [2025-03-17 10:42:23,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:23,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 10:42:23,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 10:42:23,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:23,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:42:23,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:23,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749184517] [2025-03-17 10:42:23,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749184517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:23,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:23,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:23,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085757716] [2025-03-17 10:42:23,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:23,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:23,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:23,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:23,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:23,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 206 [2025-03-17 10:42:23,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 178 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 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-17 10:42:23,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:23,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 206 [2025-03-17 10:42:23,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:23,674 INFO L124 PetriNetUnfolderBase]: 51/672 cut-off events. [2025-03-17 10:42:23,674 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 10:42:23,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 672 events. 51/672 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3013 event pairs, 26 based on Foata normal form. 0/653 useless extension candidates. Maximal degree in co-relation 772. Up to 105 conditions per place. [2025-03-17 10:42:23,675 INFO L140 encePairwiseOnDemand]: 200/206 looper letters, 0 selfloop transitions, 0 changer transitions 181/181 dead transitions. [2025-03-17 10:42:23,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 181 transitions, 454 flow [2025-03-17 10:42:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:42:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:42:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1082 transitions. [2025-03-17 10:42:23,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8754045307443366 [2025-03-17 10:42:23,678 INFO L175 Difference]: Start difference. First operand has 186 places, 178 transitions, 394 flow. Second operand 6 states and 1082 transitions. [2025-03-17 10:42:23,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 181 transitions, 454 flow [2025-03-17 10:42:23,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 181 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:23,679 INFO L231 Difference]: Finished difference. Result has 183 places, 0 transitions, 0 flow [2025-03-17 10:42:23,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=183, PETRI_TRANSITIONS=0} [2025-03-17 10:42:23,680 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -13 predicate places. [2025-03-17 10:42:23,680 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 0 transitions, 0 flow [2025-03-17 10:42:23,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 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-17 10:42:23,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2025-03-17 10:42:23,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2025-03-17 10:42:23,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:42:23,684 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:23,687 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:42:23,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:42:23,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:42:23 BasicIcfg [2025-03-17 10:42:23,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:42:23,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:42:23,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:42:23,691 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:42:23,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:19" (3/4) ... [2025-03-17 10:42:23,693 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 10:42:23,695 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-17 10:42:23,695 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-17 10:42:23,697 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 10:42:23,697 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 10:42:23,697 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 10:42:23,697 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 10:42:23,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:42:23,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:42:23,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:42:23,747 INFO L158 Benchmark]: Toolchain (without parser) took 4798.24ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 156.8MB in the beginning and 112.8MB in the end (delta: 44.0MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. [2025-03-17 10:42:23,748 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:42:23,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.79ms. Allocated memory is still 201.3MB. Free memory was 156.4MB in the beginning and 127.2MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 10:42:23,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.30ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 124.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:42:23,750 INFO L158 Benchmark]: Boogie Preprocessor took 22.50ms. Allocated memory is still 201.3MB. Free memory was 124.6MB in the beginning and 123.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:42:23,751 INFO L158 Benchmark]: IcfgBuilder took 411.83ms. Allocated memory is still 201.3MB. Free memory was 123.1MB in the beginning and 101.3MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 10:42:23,751 INFO L158 Benchmark]: TraceAbstraction took 3789.67ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 100.9MB in the beginning and 117.9MB in the end (delta: -17.0MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2025-03-17 10:42:23,752 INFO L158 Benchmark]: Witness Printer took 55.22ms. Allocated memory is still 293.6MB. Free memory was 117.9MB in the beginning and 112.8MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:42:23,752 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.79ms. Allocated memory is still 201.3MB. Free memory was 156.4MB in the beginning and 127.2MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.30ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 124.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.50ms. Allocated memory is still 201.3MB. Free memory was 124.6MB in the beginning and 123.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 411.83ms. Allocated memory is still 201.3MB. Free memory was 123.1MB in the beginning and 101.3MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3789.67ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 100.9MB in the beginning and 117.9MB in the end (delta: -17.0MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * Witness Printer took 55.22ms. Allocated memory is still 293.6MB. Free memory was 117.9MB in the beginning and 112.8MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 962]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 969]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1009]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 976]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 950]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 950]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 984]: 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 5 procedures, 350 locations, 369 edges, 24 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: 3.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 491 IncrementalHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 49 mSDtfsCounter, 491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=774occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 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 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 10:42:23,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE