./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-atomic/read_write_lock-1b.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 d6a3f8c57ab77e58af8013fe9ddd1fa7c1d656ac7e087660662f74a34f2abc91 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:29:32,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:29:33,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:29:33,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:29:33,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:29:33,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:29:33,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:29:33,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:29:33,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:29:33,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:29:33,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:29:33,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:29:33,060 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:29:33,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:29:33,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:29:33,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:29:33,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:29:33,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:29:33,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:29:33,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:29:33,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:29:33,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:29:33,068 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:29:33,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:29:33,069 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:29:33,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:29:33,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:29:33,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:29:33,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:29:33,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:29:33,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:29:33,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:29:33,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:29:33,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:29:33,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:29:33,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:29:33,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:29:33,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:29:33,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:29:33,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:29:33,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:29:33,077 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> d6a3f8c57ab77e58af8013fe9ddd1fa7c1d656ac7e087660662f74a34f2abc91 [2024-11-09 06:29:33,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:29:33,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:29:33,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:29:33,461 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:29:33,462 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:29:33,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2024-11-09 06:29:35,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:29:35,273 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:29:35,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2024-11-09 06:29:35,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dfeebb60/43901f9aabec45419d3b0fbad0fe7249/FLAG5fe695f56 [2024-11-09 06:29:35,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dfeebb60/43901f9aabec45419d3b0fbad0fe7249 [2024-11-09 06:29:35,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:29:35,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:29:35,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:29:35,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:29:35,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:29:35,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494fb2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35, skipping insertion in model container [2024-11-09 06:29:35,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:29:35,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:29:35,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:29:35,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:29:35,910 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:29:35,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35 WrapperNode [2024-11-09 06:29:35,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:29:35,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:29:35,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:29:35,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:29:35,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,970 INFO L138 Inliner]: procedures = 163, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-09 06:29:35,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:29:35,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:29:35,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:29:35,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:29:35,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:35,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:29:35,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:29:35,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:29:35,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:29:36,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (1/1) ... [2024-11-09 06:29:36,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:29:36,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:29:36,051 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) [2024-11-09 06:29:36,055 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 [2024-11-09 06:29:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockUnlock [2024-11-09 06:29:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockReadLock [2024-11-09 06:29:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:29:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-11-09 06:29:36,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-11-09 06:29:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockWriteLock [2024-11-09 06:29:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:29:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:29:36,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:29:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-11-09 06:29:36,120 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-11-09 06:29:36,122 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:29:36,280 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:29:36,282 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:29:36,530 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:29:36,530 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:29:36,574 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:29:36,575 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:29:36,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:29:36 BoogieIcfgContainer [2024-11-09 06:29:36,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:29:36,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:29:36,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:29:36,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:29:36,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:29:35" (1/3) ... [2024-11-09 06:29:36,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479deafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:29:36, skipping insertion in model container [2024-11-09 06:29:36,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:35" (2/3) ... [2024-11-09 06:29:36,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479deafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:29:36, skipping insertion in model container [2024-11-09 06:29:36,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:29:36" (3/3) ... [2024-11-09 06:29:36,589 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1b.i [2024-11-09 06:29:36,610 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:29:36,610 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-09 06:29:36,612 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:29:36,734 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 06:29:36,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 147 transitions, 322 flow [2024-11-09 06:29:36,873 INFO L124 PetriNetUnfolderBase]: 4/143 cut-off events. [2024-11-09 06:29:36,873 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:29:36,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 143 events. 4/143 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 246 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2024-11-09 06:29:36,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 147 transitions, 322 flow [2024-11-09 06:29:36,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 138 transitions, 297 flow [2024-11-09 06:29:36,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:29:36,927 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;@64bd8e68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:29:36,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-09 06:29:36,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:29:36,939 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2024-11-09 06:29:36,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:29:36,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:29:36,942 INFO L204 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] [2024-11-09 06:29:36,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-09 06:29:36,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1401411878, now seen corresponding path program 1 times [2024-11-09 06:29:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:29:36,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001198472] [2024-11-09 06:29:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:29:37,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001198472] [2024-11-09 06:29:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001198472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:37,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:37,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:29:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948700164] [2024-11-09 06:29:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:37,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:29:37,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:29:37,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:29:37,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:29:37,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 147 [2024-11-09 06:29:37,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 138 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2024-11-09 06:29:37,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:29:37,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 147 [2024-11-09 06:29:37,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:29:38,941 INFO L124 PetriNetUnfolderBase]: 2982/7601 cut-off events. [2024-11-09 06:29:38,941 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2024-11-09 06:29:38,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12534 conditions, 7601 events. 2982/7601 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 73549 event pairs, 2154 based on Foata normal form. 809/7398 useless extension candidates. Maximal degree in co-relation 12299. Up to 3608 conditions per place. [2024-11-09 06:29:39,053 INFO L140 encePairwiseOnDemand]: 134/147 looper letters, 33 selfloop transitions, 8 changer transitions 0/148 dead transitions. [2024-11-09 06:29:39,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 148 transitions, 408 flow [2024-11-09 06:29:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:29:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:29:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2024-11-09 06:29:39,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.909297052154195 [2024-11-09 06:29:39,075 INFO L175 Difference]: Start difference. First operand has 147 places, 138 transitions, 297 flow. Second operand 3 states and 401 transitions. [2024-11-09 06:29:39,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 148 transitions, 408 flow [2024-11-09 06:29:39,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 148 transitions, 390 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-09 06:29:39,089 INFO L231 Difference]: Finished difference. Result has 142 places, 139 transitions, 334 flow [2024-11-09 06:29:39,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=142, PETRI_TRANSITIONS=139} [2024-11-09 06:29:39,097 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, -5 predicate places. [2024-11-09 06:29:39,097 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 139 transitions, 334 flow [2024-11-09 06:29:39,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2024-11-09 06:29:39,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:29:39,098 INFO L204 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] [2024-11-09 06:29:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:29:39,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-09 06:29:39,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 423879018, now seen corresponding path program 1 times [2024-11-09 06:29:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:29:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579252392] [2024-11-09 06:29:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:39,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:29:39,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579252392] [2024-11-09 06:29:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579252392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:39,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:39,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:29:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792112426] [2024-11-09 06:29:39,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:39,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:29:39,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:29:39,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:29:39,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:29:39,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 147 [2024-11-09 06:29:39,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 139 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2024-11-09 06:29:39,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:29:39,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 147 [2024-11-09 06:29:39,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:29:42,509 INFO L124 PetriNetUnfolderBase]: 9490/25323 cut-off events. [2024-11-09 06:29:42,509 INFO L125 PetriNetUnfolderBase]: For 6356/7074 co-relation queries the response was YES. [2024-11-09 06:29:42,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46461 conditions, 25323 events. 9490/25323 cut-off events. For 6356/7074 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 300648 event pairs, 3033 based on Foata normal form. 24/21365 useless extension candidates. Maximal degree in co-relation 41712. Up to 7778 conditions per place. [2024-11-09 06:29:42,827 INFO L140 encePairwiseOnDemand]: 133/147 looper letters, 47 selfloop transitions, 15 changer transitions 0/167 dead transitions. [2024-11-09 06:29:42,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 167 transitions, 554 flow [2024-11-09 06:29:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:29:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:29:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-11-09 06:29:42,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8956916099773242 [2024-11-09 06:29:42,831 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 334 flow. Second operand 3 states and 395 transitions. [2024-11-09 06:29:42,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 167 transitions, 554 flow [2024-11-09 06:29:43,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 167 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:29:43,094 INFO L231 Difference]: Finished difference. Result has 144 places, 154 transitions, 468 flow [2024-11-09 06:29:43,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=144, PETRI_TRANSITIONS=154} [2024-11-09 06:29:43,096 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, -3 predicate places. [2024-11-09 06:29:43,096 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 154 transitions, 468 flow [2024-11-09 06:29:43,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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) [2024-11-09 06:29:43,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:29:43,098 INFO L204 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] [2024-11-09 06:29:43,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:29:43,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr1ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-09 06:29:43,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash 684407277, now seen corresponding path program 1 times [2024-11-09 06:29:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:29:43,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424429762] [2024-11-09 06:29:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:29:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424429762] [2024-11-09 06:29:43,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424429762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:43,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:43,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:29:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833499620] [2024-11-09 06:29:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:43,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:29:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:29:43,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:29:43,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:29:43,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 147 [2024-11-09 06:29:43,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 154 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2024-11-09 06:29:43,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:29:43,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 147 [2024-11-09 06:29:43,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:29:46,636 INFO L124 PetriNetUnfolderBase]: 10517/30535 cut-off events. [2024-11-09 06:29:46,637 INFO L125 PetriNetUnfolderBase]: For 7995/10010 co-relation queries the response was YES. [2024-11-09 06:29:46,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55861 conditions, 30535 events. 10517/30535 cut-off events. For 7995/10010 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 398788 event pairs, 5469 based on Foata normal form. 54/25968 useless extension candidates. Maximal degree in co-relation 51067. Up to 9255 conditions per place. [2024-11-09 06:29:46,974 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 31 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2024-11-09 06:29:46,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 167 transitions, 570 flow [2024-11-09 06:29:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:29:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:29:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2024-11-09 06:29:46,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8934240362811792 [2024-11-09 06:29:46,977 INFO L175 Difference]: Start difference. First operand has 144 places, 154 transitions, 468 flow. Second operand 3 states and 394 transitions. [2024-11-09 06:29:46,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 167 transitions, 570 flow [2024-11-09 06:29:46,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 167 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:29:47,001 INFO L231 Difference]: Finished difference. Result has 146 places, 158 transitions, 476 flow [2024-11-09 06:29:47,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=146, PETRI_TRANSITIONS=158} [2024-11-09 06:29:47,002 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, -1 predicate places. [2024-11-09 06:29:47,003 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 158 transitions, 476 flow [2024-11-09 06:29:47,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2024-11-09 06:29:47,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:29:47,003 INFO L204 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] [2024-11-09 06:29:47,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:29:47,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-09 06:29:47,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash -593745293, now seen corresponding path program 1 times [2024-11-09 06:29:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:29:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663167586] [2024-11-09 06:29:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:29:47,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663167586] [2024-11-09 06:29:47,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663167586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:47,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:47,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:29:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103698513] [2024-11-09 06:29:47,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:47,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:29:47,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:29:47,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:29:47,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:29:47,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 147 [2024-11-09 06:29:47,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 158 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2024-11-09 06:29:47,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:29:47,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 147 [2024-11-09 06:29:47,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:29:47,496 INFO L124 PetriNetUnfolderBase]: 590/2985 cut-off events. [2024-11-09 06:29:47,496 INFO L125 PetriNetUnfolderBase]: For 571/856 co-relation queries the response was YES. [2024-11-09 06:29:47,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5355 conditions, 2985 events. 590/2985 cut-off events. For 571/856 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 30214 event pairs, 169 based on Foata normal form. 233/2603 useless extension candidates. Maximal degree in co-relation 3446. Up to 802 conditions per place. [2024-11-09 06:29:47,521 INFO L140 encePairwiseOnDemand]: 139/147 looper letters, 10 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2024-11-09 06:29:47,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 142 transitions, 465 flow [2024-11-09 06:29:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:29:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:29:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2024-11-09 06:29:47,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9024943310657596 [2024-11-09 06:29:47,524 INFO L175 Difference]: Start difference. First operand has 146 places, 158 transitions, 476 flow. Second operand 3 states and 398 transitions. [2024-11-09 06:29:47,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 142 transitions, 465 flow [2024-11-09 06:29:47,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 142 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:29:47,532 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 433 flow [2024-11-09 06:29:47,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=128, PETRI_TRANSITIONS=139} [2024-11-09 06:29:47,534 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, -19 predicate places. [2024-11-09 06:29:47,534 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 433 flow [2024-11-09 06:29:47,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2024-11-09 06:29:47,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:29:47,535 INFO L204 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] [2024-11-09 06:29:47,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:29:47,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-09 06:29:47,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1030330355, now seen corresponding path program 2 times [2024-11-09 06:29:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:29:47,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793764094] [2024-11-09 06:29:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:47,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:47,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:29:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793764094] [2024-11-09 06:29:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793764094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:47,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:47,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:29:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413575749] [2024-11-09 06:29:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:47,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:29:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:29:47,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:29:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:29:47,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 147 [2024-11-09 06:29:47,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 139 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2024-11-09 06:29:47,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:29:47,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 147 [2024-11-09 06:29:47,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:29:47,807 INFO L124 PetriNetUnfolderBase]: 34/326 cut-off events. [2024-11-09 06:29:47,808 INFO L125 PetriNetUnfolderBase]: For 45/54 co-relation queries the response was YES. [2024-11-09 06:29:47,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 326 events. 34/326 cut-off events. For 45/54 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1302 event pairs, 18 based on Foata normal form. 7/288 useless extension candidates. Maximal degree in co-relation 435. Up to 58 conditions per place. [2024-11-09 06:29:47,810 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 10 selfloop transitions, 1 changer transitions 11/119 dead transitions. [2024-11-09 06:29:47,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 355 flow [2024-11-09 06:29:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:29:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:29:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2024-11-09 06:29:47,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-09 06:29:47,812 INFO L175 Difference]: Start difference. First operand has 128 places, 139 transitions, 433 flow. Second operand 3 states and 392 transitions. [2024-11-09 06:29:47,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 355 flow [2024-11-09 06:29:47,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 119 transitions, 337 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-11-09 06:29:47,816 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 283 flow [2024-11-09 06:29:47,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2024-11-09 06:29:47,817 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, -22 predicate places. [2024-11-09 06:29:47,818 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 283 flow [2024-11-09 06:29:47,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2024-11-09 06:29:47,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:29:47,819 INFO L204 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] [2024-11-09 06:29:47,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:29:47,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr2ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-09 06:29:47,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash 967731936, now seen corresponding path program 1 times [2024-11-09 06:29:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:29:47,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266155704] [2024-11-09 06:29:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:47,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:47,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:29:47,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266155704] [2024-11-09 06:29:47,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266155704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:47,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:47,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:29:47,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411207484] [2024-11-09 06:29:47,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:47,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:29:47,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:29:47,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:29:47,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:29:47,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 147 [2024-11-09 06:29:47,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2024-11-09 06:29:47,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:29:47,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 147 [2024-11-09 06:29:47,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:29:47,957 INFO L124 PetriNetUnfolderBase]: 52/394 cut-off events. [2024-11-09 06:29:47,958 INFO L125 PetriNetUnfolderBase]: For 73/78 co-relation queries the response was YES. [2024-11-09 06:29:47,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 394 events. 52/394 cut-off events. For 73/78 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1903 event pairs, 21 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 649. Up to 76 conditions per place. [2024-11-09 06:29:47,960 INFO L140 encePairwiseOnDemand]: 139/147 looper letters, 20 selfloop transitions, 6 changer transitions 3/117 dead transitions. [2024-11-09 06:29:47,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 378 flow [2024-11-09 06:29:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:29:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:29:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-11-09 06:29:47,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8707482993197279 [2024-11-09 06:29:47,963 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 283 flow. Second operand 3 states and 384 transitions. [2024-11-09 06:29:47,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 378 flow [2024-11-09 06:29:47,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 373 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-09 06:29:47,966 INFO L231 Difference]: Finished difference. Result has 118 places, 110 transitions, 324 flow [2024-11-09 06:29:47,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=118, PETRI_TRANSITIONS=110} [2024-11-09 06:29:47,967 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, -29 predicate places. [2024-11-09 06:29:47,967 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 324 flow [2024-11-09 06:29:47,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2024-11-09 06:29:47,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:29:47,968 INFO L204 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] [2024-11-09 06:29:47,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:29:47,968 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-09 06:29:47,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash -723236565, now seen corresponding path program 1 times [2024-11-09 06:29:47,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:29:47,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493810306] [2024-11-09 06:29:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:48,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:29:48,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493810306] [2024-11-09 06:29:48,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493810306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:48,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:48,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:29:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418906508] [2024-11-09 06:29:48,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:48,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:29:48,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:29:48,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:29:48,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:29:48,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 147 [2024-11-09 06:29:48,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2024-11-09 06:29:48,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:29:48,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 147 [2024-11-09 06:29:48,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:29:48,091 INFO L124 PetriNetUnfolderBase]: 43/368 cut-off events. [2024-11-09 06:29:48,092 INFO L125 PetriNetUnfolderBase]: For 130/131 co-relation queries the response was YES. [2024-11-09 06:29:48,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 368 events. 43/368 cut-off events. For 130/131 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1724 event pairs, 25 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 661. Up to 70 conditions per place. [2024-11-09 06:29:48,094 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 14 selfloop transitions, 0 changer transitions 6/110 dead transitions. [2024-11-09 06:29:48,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 110 transitions, 362 flow [2024-11-09 06:29:48,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:29:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:29:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2024-11-09 06:29:48,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8299319727891157 [2024-11-09 06:29:48,096 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 324 flow. Second operand 3 states and 366 transitions. [2024-11-09 06:29:48,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 110 transitions, 362 flow [2024-11-09 06:29:48,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 110 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:29:48,099 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 295 flow [2024-11-09 06:29:48,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=295, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2024-11-09 06:29:48,101 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, -30 predicate places. [2024-11-09 06:29:48,102 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 295 flow [2024-11-09 06:29:48,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2024-11-09 06:29:48,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:29:48,102 INFO L204 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] [2024-11-09 06:29:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:29:48,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr1ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-09 06:29:48,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1998372019, now seen corresponding path program 1 times [2024-11-09 06:29:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:29:48,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682407452] [2024-11-09 06:29:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:48,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:29:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682407452] [2024-11-09 06:29:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682407452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:48,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:29:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946017281] [2024-11-09 06:29:48,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:48,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:29:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:29:48,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:29:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:29:48,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 147 [2024-11-09 06:29:48,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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) [2024-11-09 06:29:48,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:29:48,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 147 [2024-11-09 06:29:48,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:29:48,227 INFO L124 PetriNetUnfolderBase]: 55/403 cut-off events. [2024-11-09 06:29:48,227 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-11-09 06:29:48,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 403 events. 55/403 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2002 event pairs, 27 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 769. Up to 88 conditions per place. [2024-11-09 06:29:48,229 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 18 selfloop transitions, 7 changer transitions 1/109 dead transitions. [2024-11-09 06:29:48,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 109 transitions, 365 flow [2024-11-09 06:29:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:29:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:29:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2024-11-09 06:29:48,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.854875283446712 [2024-11-09 06:29:48,232 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 295 flow. Second operand 3 states and 377 transitions. [2024-11-09 06:29:48,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 109 transitions, 365 flow [2024-11-09 06:29:48,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 109 transitions, 359 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-09 06:29:48,234 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 339 flow [2024-11-09 06:29:48,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2024-11-09 06:29:48,238 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, -34 predicate places. [2024-11-09 06:29:48,238 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 339 flow [2024-11-09 06:29:48,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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) [2024-11-09 06:29:48,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:29:48,239 INFO L204 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] [2024-11-09 06:29:48,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:29:48,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr1ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-09 06:29:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash 373128934, now seen corresponding path program 1 times [2024-11-09 06:29:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:29:48,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36647831] [2024-11-09 06:29:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:29:48,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:29:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:29:48,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:29:48,324 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:29:48,329 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr1ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2024-11-09 06:29:48,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2024-11-09 06:29:48,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2024-11-09 06:29:48,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2024-11-09 06:29:48,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2024-11-09 06:29:48,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 19 remaining) [2024-11-09 06:29:48,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2024-11-09 06:29:48,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 19 remaining) [2024-11-09 06:29:48,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 19 remaining) [2024-11-09 06:29:48,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2024-11-09 06:29:48,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2024-11-09 06:29:48,335 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2024-11-09 06:29:48,335 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2024-11-09 06:29:48,335 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2024-11-09 06:29:48,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2024-11-09 06:29:48,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2024-11-09 06:29:48,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2024-11-09 06:29:48,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2024-11-09 06:29:48,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2024-11-09 06:29:48,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:29:48,338 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:48,397 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:29:48,397 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:29:48,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:29:48 BasicIcfg [2024-11-09 06:29:48,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:29:48,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:29:48,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:29:48,404 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:29:48,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:29:36" (3/4) ... [2024-11-09 06:29:48,406 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 06:29:48,459 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:29:48,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:29:48,460 INFO L158 Benchmark]: Toolchain (without parser) took 13153.22ms. Allocated memory was 155.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 74.8MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 530.8MB. Max. memory is 16.1GB. [2024-11-09 06:29:48,461 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:29:48,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.39ms. Allocated memory is still 155.2MB. Free memory was 74.6MB in the beginning and 112.1MB in the end (delta: -37.5MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-09 06:29:48,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.14ms. Allocated memory is still 155.2MB. Free memory was 112.1MB in the beginning and 110.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:29:48,462 INFO L158 Benchmark]: Boogie Preprocessor took 26.81ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 109.1MB in the end (delta: 895.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:29:48,462 INFO L158 Benchmark]: RCFGBuilder took 577.26ms. Allocated memory is still 155.2MB. Free memory was 109.1MB in the beginning and 111.4MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 06:29:48,462 INFO L158 Benchmark]: TraceAbstraction took 11824.32ms. Allocated memory was 155.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 110.5MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 559.1MB. Max. memory is 16.1GB. [2024-11-09 06:29:48,462 INFO L158 Benchmark]: Witness Printer took 55.83ms. Allocated memory is still 4.5GB. Free memory was 3.9GB in the beginning and 3.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 06:29:48,464 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.22ms. Allocated memory is still 155.2MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.39ms. Allocated memory is still 155.2MB. Free memory was 74.6MB in the beginning and 112.1MB in the end (delta: -37.5MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.14ms. Allocated memory is still 155.2MB. Free memory was 112.1MB in the beginning and 110.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.81ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 109.1MB in the end (delta: 895.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 577.26ms. Allocated memory is still 155.2MB. Free memory was 109.1MB in the beginning and 111.4MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11824.32ms. Allocated memory was 155.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 110.5MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 559.1MB. Max. memory is 16.1GB. * Witness Printer took 55.83ms. Allocated memory is still 4.5GB. Free memory was 3.9GB in the beginning and 3.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 684]: Data race detected Data race detected The following path leads to a data race: [L674] 0 int x, y; VAL [x=0, y=0] [L675] 0 pthread_rwlock_t rwlock = { { 0, 0, 0, 0, 0, 0, PTHREAD_RWLOCK_DEFAULT_NP, 0, 0, 0, 0 } }; VAL [rwlock={3:0}, x=0, y=0] [L690] 0 pthread_t t1, t2, t3, t4; VAL [rwlock={3:0}, x=0, y=0] [L691] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [\old(arg)={0:0}, rwlock={3:0}, t1=-3, x=0, y=0] [L692] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [\old(arg)={0:0}, rwlock={3:0}, t1=-3, t2=-2, x=0, y=0] [L693] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [\old(arg)={0:0}, rwlock={3:0}, t1=-3, t2=-2, t3=-1, x=0, y=0] [L694] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [\old(arg)={0:0}, rwlock={3:0}, t1=-3, t2=-2, t3=-1, t4=0, x=0, y=0] [L684] 2 y = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, rwlock={3:0}, x=0, y=0] [L684] 4 y = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, rwlock={3:0}, x=0, y=0] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. - UnprovableResult [Line: 684]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 678]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 190 locations, 19 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: 11.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 39 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 06:29:48,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE