./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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 e74a9d887f2b5ed1ee32deb282db19752d3db312511ed38f97d9f22bdf2fecb9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:03:55,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:03:55,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:03:55,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:03:55,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:03:55,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:03:55,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:03:55,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:03:55,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:03:55,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:03:55,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:03:55,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:03:55,323 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:03:55,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:03:55,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:03:55,326 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:03:55,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:03:55,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:03:55,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:03:55,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:03:55,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:03:55,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:03:55,329 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:03:55,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:03:55,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:03:55,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:03:55,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:03:55,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:03:55,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:03:55,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:03:55,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:03:55,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:03:55,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:03:55,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:03:55,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:03:55,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:03:55,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:03:55,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:03:55,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:03:55,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:03:55,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:03:55,337 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 -> e74a9d887f2b5ed1ee32deb282db19752d3db312511ed38f97d9f22bdf2fecb9 [2024-10-24 15:03:55,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:03:55,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:03:55,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:03:55,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:03:55,615 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:03:55,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2024-10-24 15:03:56,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:03:57,207 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:03:57,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2024-10-24 15:03:57,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f336c456/ed7059dbc44a4eadb43635764fbfbbb2/FLAGc29964679 [2024-10-24 15:03:57,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f336c456/ed7059dbc44a4eadb43635764fbfbbb2 [2024-10-24 15:03:57,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:03:57,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:03:57,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:03:57,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:03:57,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:03:57,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2177b774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57, skipping insertion in model container [2024-10-24 15:03:57,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:03:57,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:03:57,656 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:03:57,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:03:57,737 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:03:57,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57 WrapperNode [2024-10-24 15:03:57,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:03:57,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:03:57,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:03:57,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:03:57,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,782 INFO L138 Inliner]: procedures = 170, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-10-24 15:03:57,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:03:57,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:03:57,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:03:57,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:03:57,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:03:57,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:03:57,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:03:57,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:03:57,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (1/1) ... [2024-10-24 15:03:57,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:03:57,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:03:57,852 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-10-24 15:03:57,859 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-10-24 15:03:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:03:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-24 15:03:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-24 15:03:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:03:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:03:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:03:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-24 15:03:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-24 15:03:57,908 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:03:58,062 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:03:58,064 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:03:58,294 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:03:58,294 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:03:58,417 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:03:58,418 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 15:03:58,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:03:58 BoogieIcfgContainer [2024-10-24 15:03:58,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:03:58,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:03:58,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:03:58,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:03:58,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:03:57" (1/3) ... [2024-10-24 15:03:58,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b67e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:03:58, skipping insertion in model container [2024-10-24 15:03:58,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:03:57" (2/3) ... [2024-10-24 15:03:58,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b67e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:03:58, skipping insertion in model container [2024-10-24 15:03:58,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:03:58" (3/3) ... [2024-10-24 15:03:58,427 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1b.i [2024-10-24 15:03:58,443 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:03:58,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-24 15:03:58,444 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:03:58,532 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-24 15:03:58,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 160 transitions, 348 flow [2024-10-24 15:03:58,648 INFO L124 PetriNetUnfolderBase]: 4/156 cut-off events. [2024-10-24 15:03:58,648 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 15:03:58,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 4/156 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2024-10-24 15:03:58,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 160 transitions, 348 flow [2024-10-24 15:03:58,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 151 transitions, 323 flow [2024-10-24 15:03:58,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:03:58,688 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;@6008ed7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:03:58,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-10-24 15:03:58,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:03:58,697 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-24 15:03:58,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:03:58,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:03:58,698 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] [2024-10-24 15:03:58,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:03:58,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:03:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash 404144959, now seen corresponding path program 1 times [2024-10-24 15:03:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:03:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327850539] [2024-10-24 15:03:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:03:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:03:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:03:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:03:58,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:03:58,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327850539] [2024-10-24 15:03:58,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327850539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:03:58,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:03:58,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 15:03:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470451288] [2024-10-24 15:03:58,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:03:58,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:03:58,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:03:58,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:03:58,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:03:58,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2024-10-24 15:03:58,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 151 transitions, 323 flow. Second operand has 2 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 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-10-24 15:03:58,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:03:58,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2024-10-24 15:03:58,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:03:59,237 INFO L124 PetriNetUnfolderBase]: 119/1134 cut-off events. [2024-10-24 15:03:59,238 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2024-10-24 15:03:59,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 1134 events. 119/1134 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8092 event pairs, 119 based on Foata normal form. 56/993 useless extension candidates. Maximal degree in co-relation 1266. Up to 203 conditions per place. [2024-10-24 15:03:59,257 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 13 selfloop transitions, 0 changer transitions 0/127 dead transitions. [2024-10-24 15:03:59,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 127 transitions, 301 flow [2024-10-24 15:03:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:03:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-24 15:03:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 281 transitions. [2024-10-24 15:03:59,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.878125 [2024-10-24 15:03:59,274 INFO L175 Difference]: Start difference. First operand has 160 places, 151 transitions, 323 flow. Second operand 2 states and 281 transitions. [2024-10-24 15:03:59,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 127 transitions, 301 flow [2024-10-24 15:03:59,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 127 transitions, 288 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-24 15:03:59,285 INFO L231 Difference]: Finished difference. Result has 134 places, 127 transitions, 262 flow [2024-10-24 15:03:59,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=262, PETRI_PLACES=134, PETRI_TRANSITIONS=127} [2024-10-24 15:03:59,291 INFO L277 CegarLoopForPetriNet]: 160 programPoint places, -26 predicate places. [2024-10-24 15:03:59,291 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 127 transitions, 262 flow [2024-10-24 15:03:59,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 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-10-24 15:03:59,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:03:59,291 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] [2024-10-24 15:03:59,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:03:59,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:03:59,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:03:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash -580608188, now seen corresponding path program 1 times [2024-10-24 15:03:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:03:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648432160] [2024-10-24 15:03:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:03:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:03:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:03:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:03:59,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:03:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648432160] [2024-10-24 15:03:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648432160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:03:59,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:03:59,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:03:59,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857456658] [2024-10-24 15:03:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:03:59,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:03:59,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:03:59,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:03:59,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:03:59,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 160 [2024-10-24 15:03:59,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 127 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-10-24 15:03:59,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:03:59,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 160 [2024-10-24 15:03:59,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:04:00,332 INFO L124 PetriNetUnfolderBase]: 1931/6107 cut-off events. [2024-10-24 15:04:00,332 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-10-24 15:04:00,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9247 conditions, 6107 events. 1931/6107 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 60857 event pairs, 1220 based on Foata normal form. 0/5096 useless extension candidates. Maximal degree in co-relation 9244. Up to 2335 conditions per place. [2024-10-24 15:04:00,388 INFO L140 encePairwiseOnDemand]: 151/160 looper letters, 30 selfloop transitions, 8 changer transitions 0/142 dead transitions. [2024-10-24 15:04:00,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 142 transitions, 372 flow [2024-10-24 15:04:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:04:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:04:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2024-10-24 15:04:00,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.79375 [2024-10-24 15:04:00,391 INFO L175 Difference]: Start difference. First operand has 134 places, 127 transitions, 262 flow. Second operand 3 states and 381 transitions. [2024-10-24 15:04:00,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 142 transitions, 372 flow [2024-10-24 15:04:00,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 142 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:04:00,398 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 324 flow [2024-10-24 15:04:00,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2024-10-24 15:04:00,400 INFO L277 CegarLoopForPetriNet]: 160 programPoint places, -22 predicate places. [2024-10-24 15:04:00,400 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 324 flow [2024-10-24 15:04:00,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-10-24 15:04:00,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:04:00,401 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] [2024-10-24 15:04:00,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:04:00,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:04:00,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:04:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1047378042, now seen corresponding path program 1 times [2024-10-24 15:04:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:04:00,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825294413] [2024-10-24 15:04:00,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:04:00,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:04:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:04:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:04:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:04:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825294413] [2024-10-24 15:04:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825294413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:04:00,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:04:00,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:04:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698693939] [2024-10-24 15:04:00,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:04:00,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:04:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:04:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:04:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:04:00,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 160 [2024-10-24 15:04:00,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-10-24 15:04:00,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:04:00,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 160 [2024-10-24 15:04:00,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:04:01,507 INFO L124 PetriNetUnfolderBase]: 1788/7494 cut-off events. [2024-10-24 15:04:01,509 INFO L125 PetriNetUnfolderBase]: For 246/279 co-relation queries the response was YES. [2024-10-24 15:04:01,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11083 conditions, 7494 events. 1788/7494 cut-off events. For 246/279 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 84246 event pairs, 1181 based on Foata normal form. 0/5898 useless extension candidates. Maximal degree in co-relation 11078. Up to 1612 conditions per place. [2024-10-24 15:04:01,665 INFO L140 encePairwiseOnDemand]: 152/160 looper letters, 23 selfloop transitions, 7 changer transitions 0/145 dead transitions. [2024-10-24 15:04:01,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 145 transitions, 410 flow [2024-10-24 15:04:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:04:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:04:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2024-10-24 15:04:01,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2024-10-24 15:04:01,668 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 324 flow. Second operand 3 states and 385 transitions. [2024-10-24 15:04:01,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 145 transitions, 410 flow [2024-10-24 15:04:01,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 145 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:04:01,685 INFO L231 Difference]: Finished difference. Result has 140 places, 140 transitions, 362 flow [2024-10-24 15:04:01,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=140, PETRI_TRANSITIONS=140} [2024-10-24 15:04:01,686 INFO L277 CegarLoopForPetriNet]: 160 programPoint places, -20 predicate places. [2024-10-24 15:04:01,688 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 140 transitions, 362 flow [2024-10-24 15:04:01,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-10-24 15:04:01,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:04:01,689 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] [2024-10-24 15:04:01,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:04:01,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:04:01,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:04:01,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1638558587, now seen corresponding path program 1 times [2024-10-24 15:04:01,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:04:01,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474975366] [2024-10-24 15:04:01,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:04:01,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:04:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:04:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:04:01,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:04:01,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474975366] [2024-10-24 15:04:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474975366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:04:01,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:04:01,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:04:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163400332] [2024-10-24 15:04:01,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:04:01,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:04:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:04:01,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:04:01,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:04:01,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 160 [2024-10-24 15:04:01,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-10-24 15:04:01,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:04:01,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 160 [2024-10-24 15:04:01,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:04:05,118 INFO L124 PetriNetUnfolderBase]: 9825/31017 cut-off events. [2024-10-24 15:04:05,118 INFO L125 PetriNetUnfolderBase]: For 8793/9594 co-relation queries the response was YES. [2024-10-24 15:04:05,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57048 conditions, 31017 events. 9825/31017 cut-off events. For 8793/9594 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 406449 event pairs, 3338 based on Foata normal form. 43/25586 useless extension candidates. Maximal degree in co-relation 57042. Up to 8588 conditions per place. [2024-10-24 15:04:05,606 INFO L140 encePairwiseOnDemand]: 146/160 looper letters, 49 selfloop transitions, 15 changer transitions 0/169 dead transitions. [2024-10-24 15:04:05,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 169 transitions, 594 flow [2024-10-24 15:04:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:04:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:04:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2024-10-24 15:04:05,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7958333333333333 [2024-10-24 15:04:05,609 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 362 flow. Second operand 3 states and 382 transitions. [2024-10-24 15:04:05,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 169 transitions, 594 flow [2024-10-24 15:04:05,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 169 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:04:05,648 INFO L231 Difference]: Finished difference. Result has 142 places, 155 transitions, 498 flow [2024-10-24 15:04:05,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=142, PETRI_TRANSITIONS=155} [2024-10-24 15:04:05,649 INFO L277 CegarLoopForPetriNet]: 160 programPoint places, -18 predicate places. [2024-10-24 15:04:05,650 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 155 transitions, 498 flow [2024-10-24 15:04:05,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-10-24 15:04:05,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:04:05,651 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] [2024-10-24 15:04:05,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:04:05,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:04:05,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:04:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1154242415, now seen corresponding path program 1 times [2024-10-24 15:04:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:04:05,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240108300] [2024-10-24 15:04:05,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:04:05,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:04:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:04:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:04:05,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:04:05,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240108300] [2024-10-24 15:04:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240108300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:04:05,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:04:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:04:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614045616] [2024-10-24 15:04:05,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:04:05,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:04:05,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:04:05,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:04:05,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:04:05,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 160 [2024-10-24 15:04:05,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 155 transitions, 498 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 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-10-24 15:04:05,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:04:05,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 160 [2024-10-24 15:04:05,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:04:10,301 INFO L124 PetriNetUnfolderBase]: 11509/43623 cut-off events. [2024-10-24 15:04:10,301 INFO L125 PetriNetUnfolderBase]: For 14070/17846 co-relation queries the response was YES. [2024-10-24 15:04:10,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79345 conditions, 43623 events. 11509/43623 cut-off events. For 14070/17846 co-relation queries the response was YES. Maximal size of possible extension queue 1961. Compared 644474 event pairs, 2696 based on Foata normal form. 83/36420 useless extension candidates. Maximal degree in co-relation 79338. Up to 7572 conditions per place. [2024-10-24 15:04:10,784 INFO L140 encePairwiseOnDemand]: 150/160 looper letters, 31 selfloop transitions, 17 changer transitions 0/183 dead transitions. [2024-10-24 15:04:10,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 183 transitions, 683 flow [2024-10-24 15:04:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:04:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 15:04:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2024-10-24 15:04:10,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.80625 [2024-10-24 15:04:10,787 INFO L175 Difference]: Start difference. First operand has 142 places, 155 transitions, 498 flow. Second operand 5 states and 645 transitions. [2024-10-24 15:04:10,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 183 transitions, 683 flow [2024-10-24 15:04:10,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 183 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:04:10,826 INFO L231 Difference]: Finished difference. Result has 147 places, 169 transitions, 591 flow [2024-10-24 15:04:10,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=147, PETRI_TRANSITIONS=169} [2024-10-24 15:04:10,829 INFO L277 CegarLoopForPetriNet]: 160 programPoint places, -13 predicate places. [2024-10-24 15:04:10,829 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 169 transitions, 591 flow [2024-10-24 15:04:10,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 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-10-24 15:04:10,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:04:10,830 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] [2024-10-24 15:04:10,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:04:10,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:04:10,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:04:10,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1792662601, now seen corresponding path program 2 times [2024-10-24 15:04:10,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:04:10,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295962565] [2024-10-24 15:04:10,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:04:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:04:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:04:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:04:10,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:04:10,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295962565] [2024-10-24 15:04:10,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295962565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:04:10,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:04:10,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:04:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011063234] [2024-10-24 15:04:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:04:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:04:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:04:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:04:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:04:10,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 160 [2024-10-24 15:04:10,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 169 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-10-24 15:04:10,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:04:10,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 160 [2024-10-24 15:04:10,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:04:12,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([407] L711-8-->L712: Formula: (= (+ v_~r~0_73 1) v_~r~0_74) InVars {~r~0=v_~r~0_74} OutVars{readerThread1of1ForFork1___VERIFIER_atomic_release_read_lock_#t~nondet6#1=|v_readerThread1of1ForFork1___VERIFIER_atomic_release_read_lock_#t~nondet6#1_5|, #race~r~0=|v_#race~r~0_112|, ~r~0=v_~r~0_73} AuxVars[] AssignedVars[readerThread1of1ForFork1___VERIFIER_atomic_release_read_lock_#t~nondet6#1, #race~r~0, ~r~0][158], [75#L721-1true, Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 189#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 164#true, 50#L712true, Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), 78#L712true, 199#(= ~w~0 1), 39#L701-1true, Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), Black: 184#true]) [2024-10-24 15:04:12,282 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is not cut-off event [2024-10-24 15:04:12,282 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2024-10-24 15:04:12,282 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2024-10-24 15:04:12,282 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2024-10-24 15:04:12,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([407] L711-8-->L712: Formula: (= (+ v_~r~0_73 1) v_~r~0_74) InVars {~r~0=v_~r~0_74} OutVars{readerThread1of1ForFork1___VERIFIER_atomic_release_read_lock_#t~nondet6#1=|v_readerThread1of1ForFork1___VERIFIER_atomic_release_read_lock_#t~nondet6#1_5|, #race~r~0=|v_#race~r~0_112|, ~r~0=v_~r~0_73} AuxVars[] AssignedVars[readerThread1of1ForFork1___VERIFIER_atomic_release_read_lock_#t~nondet6#1, #race~r~0, ~r~0][158], [Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 189#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 85#L722true, 78#L712true, 199#(= ~w~0 1), 39#L701-1true, Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 164#true, Black: 184#true]) [2024-10-24 15:04:12,303 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is not cut-off event [2024-10-24 15:04:12,303 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2024-10-24 15:04:12,303 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2024-10-24 15:04:12,303 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2024-10-24 15:04:12,315 INFO L124 PetriNetUnfolderBase]: 3361/16648 cut-off events. [2024-10-24 15:04:12,315 INFO L125 PetriNetUnfolderBase]: For 6382/7333 co-relation queries the response was YES. [2024-10-24 15:04:12,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30022 conditions, 16648 events. 3361/16648 cut-off events. For 6382/7333 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 227357 event pairs, 982 based on Foata normal form. 174/13854 useless extension candidates. Maximal degree in co-relation 30013. Up to 2730 conditions per place. [2024-10-24 15:04:12,444 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 25 selfloop transitions, 7 changer transitions 0/166 dead transitions. [2024-10-24 15:04:12,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 166 transitions, 621 flow [2024-10-24 15:04:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:04:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:04:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2024-10-24 15:04:12,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8125 [2024-10-24 15:04:12,446 INFO L175 Difference]: Start difference. First operand has 147 places, 169 transitions, 591 flow. Second operand 3 states and 390 transitions. [2024-10-24 15:04:12,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 166 transitions, 621 flow [2024-10-24 15:04:12,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 166 transitions, 607 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-10-24 15:04:12,457 INFO L231 Difference]: Finished difference. Result has 148 places, 159 transitions, 533 flow [2024-10-24 15:04:12,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=148, PETRI_TRANSITIONS=159} [2024-10-24 15:04:12,458 INFO L277 CegarLoopForPetriNet]: 160 programPoint places, -12 predicate places. [2024-10-24 15:04:12,458 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 159 transitions, 533 flow [2024-10-24 15:04:12,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-10-24 15:04:12,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:04:12,459 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] [2024-10-24 15:04:12,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:04:12,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:04:12,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:04:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1763924184, now seen corresponding path program 1 times [2024-10-24 15:04:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:04:12,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101924675] [2024-10-24 15:04:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:04:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:04:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:04:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:04:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:04:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101924675] [2024-10-24 15:04:12,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101924675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:04:12,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:04:12,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:04:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921527879] [2024-10-24 15:04:12,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:04:12,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:04:12,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:04:12,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:04:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:04:12,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 160 [2024-10-24 15:04:12,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 159 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-10-24 15:04:12,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:04:12,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 160 [2024-10-24 15:04:12,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:04:15,020 INFO L124 PetriNetUnfolderBase]: 6691/28720 cut-off events. [2024-10-24 15:04:15,020 INFO L125 PetriNetUnfolderBase]: For 15639/16828 co-relation queries the response was YES. [2024-10-24 15:04:15,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54309 conditions, 28720 events. 6691/28720 cut-off events. For 15639/16828 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 415658 event pairs, 2681 based on Foata normal form. 2/23528 useless extension candidates. Maximal degree in co-relation 54300. Up to 5408 conditions per place. [2024-10-24 15:04:15,282 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 39 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2024-10-24 15:04:15,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 173 transitions, 684 flow [2024-10-24 15:04:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:04:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:04:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2024-10-24 15:04:15,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.79375 [2024-10-24 15:04:15,284 INFO L175 Difference]: Start difference. First operand has 148 places, 159 transitions, 533 flow. Second operand 3 states and 381 transitions. [2024-10-24 15:04:15,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 173 transitions, 684 flow [2024-10-24 15:04:15,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 173 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:04:15,302 INFO L231 Difference]: Finished difference. Result has 150 places, 163 transitions, 557 flow [2024-10-24 15:04:15,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=557, PETRI_PLACES=150, PETRI_TRANSITIONS=163} [2024-10-24 15:04:15,303 INFO L277 CegarLoopForPetriNet]: 160 programPoint places, -10 predicate places. [2024-10-24 15:04:15,303 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 163 transitions, 557 flow [2024-10-24 15:04:15,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-10-24 15:04:15,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:04:15,304 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-10-24 15:04:15,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:04:15,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:04:15,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:04:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1144111981, now seen corresponding path program 1 times [2024-10-24 15:04:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:04:15,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983451471] [2024-10-24 15:04:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:04:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:04:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:04:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:04:15,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:04:15,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983451471] [2024-10-24 15:04:15,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983451471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:04:15,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:04:15,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:04:15,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981966414] [2024-10-24 15:04:15,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:04:15,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:04:15,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:04:15,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:04:15,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:04:15,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 160 [2024-10-24 15:04:15,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 163 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-10-24 15:04:15,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:04:15,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 160 [2024-10-24 15:04:15,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:04:18,587 INFO L124 PetriNetUnfolderBase]: 9120/35421 cut-off events. [2024-10-24 15:04:18,587 INFO L125 PetriNetUnfolderBase]: For 21799/27109 co-relation queries the response was YES. [2024-10-24 15:04:18,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72500 conditions, 35421 events. 9120/35421 cut-off events. For 21799/27109 co-relation queries the response was YES. Maximal size of possible extension queue 1754. Compared 516481 event pairs, 3425 based on Foata normal form. 117/29605 useless extension candidates. Maximal degree in co-relation 72490. Up to 9634 conditions per place. [2024-10-24 15:04:18,873 INFO L140 encePairwiseOnDemand]: 152/160 looper letters, 49 selfloop transitions, 12 changer transitions 0/178 dead transitions. [2024-10-24 15:04:18,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 178 transitions, 749 flow [2024-10-24 15:04:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:04:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:04:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2024-10-24 15:04:18,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7854166666666667 [2024-10-24 15:04:18,874 INFO L175 Difference]: Start difference. First operand has 150 places, 163 transitions, 557 flow. Second operand 3 states and 377 transitions. [2024-10-24 15:04:18,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 178 transitions, 749 flow [2024-10-24 15:04:18,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 178 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:04:18,950 INFO L231 Difference]: Finished difference. Result has 152 places, 173 transitions, 669 flow [2024-10-24 15:04:18,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=152, PETRI_TRANSITIONS=173} [2024-10-24 15:04:18,951 INFO L277 CegarLoopForPetriNet]: 160 programPoint places, -8 predicate places. [2024-10-24 15:04:18,951 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 173 transitions, 669 flow [2024-10-24 15:04:18,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-10-24 15:04:18,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:04:18,952 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] [2024-10-24 15:04:18,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:04:18,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr5ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:04:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:04:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash -140111680, now seen corresponding path program 1 times [2024-10-24 15:04:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:04:18,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490702551] [2024-10-24 15:04:18,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:04:18,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:04:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:04:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:04:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:04:18,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490702551] [2024-10-24 15:04:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490702551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:04:18,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:04:18,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:04:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500868603] [2024-10-24 15:04:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:04:18,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:04:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:04:18,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:04:18,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:04:19,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 160 [2024-10-24 15:04:19,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 173 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-10-24 15:04:19,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:04:19,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 160 [2024-10-24 15:04:19,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:04:21,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L708-->L708-1: Formula: (and (not (= (ite (= v_~w~0_56 0) 1 0) 0)) (= v_~r~0_67 (+ v_~r~0_68 1)) (= |v_#race~w~0_77| 0)) InVars {~w~0=v_~w~0_56, ~r~0=v_~r~0_68} OutVars{~w~0=v_~w~0_56, readerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, #race~r~0=|v_#race~r~0_104|, readerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork1_assume_abort_if_not_~cond#1_5|, readerThread1of1ForFork1___VERIFIER_atomic_take_read_lock_#t~nondet5#1=|v_readerThread1of1ForFork1___VERIFIER_atomic_take_read_lock_#t~nondet5#1_7|, #race~w~0=|v_#race~w~0_77|, ~r~0=v_~r~0_67} AuxVars[] AssignedVars[readerThread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~r~0, readerThread1of1ForFork1_assume_abort_if_not_~cond#1, readerThread1of1ForFork1___VERIFIER_atomic_take_read_lock_#t~nondet5#1, #race~w~0, ~r~0][134], [Black: 189#true, 205#true, Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 164#true, 88#L708-1true, 191#(= ~w~0 0), 50#L712true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 31#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, 45#L703-1true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:21,148 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is not cut-off event [2024-10-24 15:04:21,148 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2024-10-24 15:04:21,148 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2024-10-24 15:04:21,148 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2024-10-24 15:04:21,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][186], [Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 164#true, 73#L711-4true, 41#L702-3true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 135#L711-3true, 45#L703-1true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:21,723 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-24 15:04:21,723 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-24 15:04:21,723 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-24 15:04:21,723 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-24 15:04:21,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][137], [Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 73#L711-4true, 164#true, 118#L703true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), 49#L703-1true, Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 135#L711-3true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:21,928 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-10-24 15:04:21,928 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-24 15:04:21,928 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-24 15:04:21,928 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-24 15:04:21,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][137], [Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 164#true, 73#L711-4true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), 94#L703true, Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 135#L711-3true, 45#L703-1true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:21,943 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-10-24 15:04:21,943 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-24 15:04:21,943 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-24 15:04:21,943 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-10-24 15:04:21,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][186], [Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 172#true, 59#L703-3true, 164#true, 73#L711-4true, 41#L702-3true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 135#L711-3true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:21,963 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-10-24 15:04:21,963 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-24 15:04:21,963 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-24 15:04:21,963 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-24 15:04:22,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][185], [Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 164#true, 73#L711-4true, 16#L702-3true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 31#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, 135#L711-3true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:22,029 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,029 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,029 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,029 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][137], [Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 164#true, 73#L711-4true, 117#L703-3true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), 118#L703true, Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 135#L711-3true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:22,131 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,131 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,131 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,131 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][137], [Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 59#L703-3true, 164#true, 73#L711-4true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), 94#L703true, Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 135#L711-3true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:22,425 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,425 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,425 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,425 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:04:22,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][137], [42#L703-4true, Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 164#true, 73#L711-4true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), 118#L703true, Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 135#L711-3true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:22,474 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-10-24 15:04:22,474 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-10-24 15:04:22,474 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-10-24 15:04:22,474 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-10-24 15:04:22,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][137], [Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 164#true, 73#L711-4true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), 118#L703true, Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 31#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, 135#L711-3true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:22,486 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-10-24 15:04:22,486 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-10-24 15:04:22,486 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-10-24 15:04:22,486 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-10-24 15:04:22,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][137], [130#L704true, Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 73#L711-4true, 164#true, 118#L703true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 67#L720-4true, 135#L711-3true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:22,544 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-24 15:04:22,544 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-24 15:04:22,544 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-24 15:04:22,544 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-24 15:04:22,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][137], [75#L721-1true, Black: 193#(and (<= 1 ~r~0) (= ~w~0 0)), 205#true, 172#true, Black: 192#(and (= ~r~0 0) (= ~w~0 0)), 164#true, 73#L711-4true, Black: 202#(= |#race~y~0| |readerThread1of1ForFork2_#t~nondet9#1|), 118#L703true, Black: 207#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 176#(= |writerThread1of1ForFork0_#t~nondet7#1| |#race~x~0|), Black: 181#(= |writerThread1of1ForFork0_#t~nondet8#1| |#race~w~0|), 135#L711-3true, Black: 184#true, 212#(= |#race~y~0| 0)]) [2024-10-24 15:04:22,801 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2024-10-24 15:04:22,801 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-10-24 15:04:22,801 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-10-24 15:04:22,801 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-10-24 15:04:22,895 INFO L124 PetriNetUnfolderBase]: 10521/43339 cut-off events. [2024-10-24 15:04:22,895 INFO L125 PetriNetUnfolderBase]: For 33597/36716 co-relation queries the response was YES. [2024-10-24 15:04:23,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93025 conditions, 43339 events. 10521/43339 cut-off events. For 33597/36716 co-relation queries the response was YES. Maximal size of possible extension queue 2239. Compared 664949 event pairs, 2277 based on Foata normal form. 256/37434 useless extension candidates. Maximal degree in co-relation 93014. Up to 7853 conditions per place. [2024-10-24 15:04:23,341 INFO L140 encePairwiseOnDemand]: 152/160 looper letters, 47 selfloop transitions, 7 changer transitions 0/195 dead transitions. [2024-10-24 15:04:23,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 195 transitions, 873 flow [2024-10-24 15:04:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:04:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:04:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2024-10-24 15:04:23,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8083333333333333 [2024-10-24 15:04:23,344 INFO L175 Difference]: Start difference. First operand has 152 places, 173 transitions, 669 flow. Second operand 3 states and 388 transitions. [2024-10-24 15:04:23,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 195 transitions, 873 flow [2024-10-24 15:04:23,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 195 transitions, 833 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-10-24 15:04:23,432 INFO L231 Difference]: Finished difference. Result has 154 places, 179 transitions, 691 flow [2024-10-24 15:04:23,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=154, PETRI_TRANSITIONS=179} [2024-10-24 15:04:23,433 INFO L277 CegarLoopForPetriNet]: 160 programPoint places, -6 predicate places. [2024-10-24 15:04:23,433 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 179 transitions, 691 flow [2024-10-24 15:04:23,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-10-24 15:04:23,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:04:23,433 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] [2024-10-24 15:04:23,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:04:23,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-10-24 15:04:23,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:04:23,434 INFO L85 PathProgramCache]: Analyzing trace with hash -267926212, now seen corresponding path program 1 times [2024-10-24 15:04:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:04:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597491155] [2024-10-24 15:04:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:04:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:04:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:04:23,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:04:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:04:23,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:04:23,501 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:04:23,502 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location writerErr4ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2024-10-24 15:04:23,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2024-10-24 15:04:23,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-10-24 15:04:23,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-10-24 15:04:23,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-10-24 15:04:23,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-10-24 15:04:23,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-10-24 15:04:23,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-10-24 15:04:23,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-10-24 15:04:23,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-10-24 15:04:23,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 46 remaining) [2024-10-24 15:04:23,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 46 remaining) [2024-10-24 15:04:23,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 46 remaining) [2024-10-24 15:04:23,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-10-24 15:04:23,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-10-24 15:04:23,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-10-24 15:04:23,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2024-10-24 15:04:23,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2024-10-24 15:04:23,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2024-10-24 15:04:23,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2024-10-24 15:04:23,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-10-24 15:04:23,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-10-24 15:04:23,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-10-24 15:04:23,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-10-24 15:04:23,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-10-24 15:04:23,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-10-24 15:04:23,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2024-10-24 15:04:23,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2024-10-24 15:04:23,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-10-24 15:04:23,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-10-24 15:04:23,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-10-24 15:04:23,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-10-24 15:04:23,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-10-24 15:04:23,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-10-24 15:04:23,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-10-24 15:04:23,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-10-24 15:04:23,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:04:23,518 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:04:23,564 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 15:04:23,564 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:04:23,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:04:23 BasicIcfg [2024-10-24 15:04:23,572 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:04:23,573 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:04:23,573 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:04:23,573 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:04:23,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:03:58" (3/4) ... [2024-10-24 15:04:23,576 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 15:04:23,577 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:04:23,577 INFO L158 Benchmark]: Toolchain (without parser) took 26334.01ms. Allocated memory was 169.9MB in the beginning and 11.3GB in the end (delta: 11.1GB). Free memory was 136.6MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-10-24 15:04:23,578 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 90.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:04:23,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.01ms. Allocated memory is still 169.9MB. Free memory was 136.6MB in the beginning and 114.7MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 15:04:23,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.08ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:04:23,579 INFO L158 Benchmark]: Boogie Preprocessor took 25.62ms. Allocated memory is still 169.9MB. Free memory was 112.6MB in the beginning and 111.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:04:23,579 INFO L158 Benchmark]: RCFGBuilder took 609.07ms. Allocated memory is still 169.9MB. Free memory was 111.5MB in the beginning and 87.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 15:04:23,580 INFO L158 Benchmark]: TraceAbstraction took 25151.74ms. Allocated memory was 169.9MB in the beginning and 11.3GB in the end (delta: 11.1GB). Free memory was 87.4MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-10-24 15:04:23,580 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 11.3GB. Free memory was 9.4GB in the beginning and 9.4GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:04:23,581 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.11ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 90.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.01ms. Allocated memory is still 169.9MB. Free memory was 136.6MB in the beginning and 114.7MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.08ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.62ms. Allocated memory is still 169.9MB. Free memory was 112.6MB in the beginning and 111.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 609.07ms. Allocated memory is still 169.9MB. Free memory was 111.5MB in the beginning and 87.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 25151.74ms. Allocated memory was 169.9MB in the beginning and 11.3GB in the end (delta: 11.1GB). Free memory was 87.4MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 11.3GB. Free memory was 9.4GB in the beginning and 9.4GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 703]: Data race detected Data race detected The following path leads to a data race: [L688] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L716] 0 pthread_t t1, t2, t3, t4; VAL [r=0, w=0, x=0, y=0] [L717] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-1, w=0, x=0, y=0] [L718] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-1, t2=0, w=0, x=0, y=0] [L707] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L701] CALL 1 __VERIFIER_atomic_take_write_lock() [L690] EXPR 1 w==0 [L690] EXPR 1 w==0 && r==0 [L690] EXPR 1 r==0 [L690] EXPR 1 w==0 && r==0 [L690] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L690] RET 1 assume_abort_if_not(w==0 && r==0) [L691] 1 w = 1 [L701] RET 1 __VERIFIER_atomic_take_write_lock() [L702] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L703] 1 w = 0 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=3, y=0] [L708] CALL 2 __VERIFIER_atomic_take_read_lock() [L694] EXPR 2 w==0 [L694] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L694] RET 2 assume_abort_if_not(w==0) [L695] EXPR 2 r+1 [L695] 2 r = r+1 [L708] RET 2 __VERIFIER_atomic_take_read_lock() [L703] 1 w = 0 VAL [\old(arg)={0:0}, arg={0:0}, r=1, w=0, x=3, y=0] Now there is a data race on ~w~0 between C: w==0 [694] and C: w = 0 [703] - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: 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: 718]: 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: 717]: 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: 719]: 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: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: 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, 215 locations, 46 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: 24.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 41 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred in iteration=9, InterpolantAutomatonStates: 28, 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.5s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-10-24 15:04:23,613 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