./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-divine/ring_1w1r-2.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 b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:33:50,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:33:50,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:33:50,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:33:50,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:33:50,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:33:50,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:33:50,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:33:50,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:33:50,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:33:50,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:33:50,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:33:50,497 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:33:50,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:33:50,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:33:50,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:33:50,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:33:50,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:33:50,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:33:50,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:33:50,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:33:50,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:33:50,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:33:50,499 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:33:50,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:33:50,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:33:50,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:33:50,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:33:50,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:33:50,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:33:50,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:33:50,500 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b [2025-03-14 01:33:50,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:33:50,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:33:50,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:33:50,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:33:50,766 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:33:50,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-03-14 01:33:51,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d838a3e/1204709d13c54b5aa848427b4cce73de/FLAGda0a01050 [2025-03-14 01:33:52,255 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:33:52,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-03-14 01:33:52,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d838a3e/1204709d13c54b5aa848427b4cce73de/FLAGda0a01050 [2025-03-14 01:33:52,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d838a3e/1204709d13c54b5aa848427b4cce73de [2025-03-14 01:33:52,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:33:52,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:33:52,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:33:52,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:33:52,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:33:52,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52, skipping insertion in model container [2025-03-14 01:33:52,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:33:52,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:33:52,580 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:33:52,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:33:52,659 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:33:52,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52 WrapperNode [2025-03-14 01:33:52,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:33:52,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:33:52,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:33:52,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:33:52,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,720 INFO L138 Inliner]: procedures = 223, calls = 39, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 215 [2025-03-14 01:33:52,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:33:52,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:33:52,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:33:52,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:33:52,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:33:52,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:33:52,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:33:52,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:33:52,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (1/1) ... [2025-03-14 01:33:52,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:33:52,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:33:52,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:33:52,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:33:52,827 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2025-03-14 01:33:52,827 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2025-03-14 01:33:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:33:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:33:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:33:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:33:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:33:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:33:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:33:52,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:33:52,830 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:33:52,930 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:33:52,932 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:33:53,183 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc ring_empty_#t~mem15#1; [2025-03-14 01:33:53,185 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-1: havoc ring_empty_#t~mem14#1; [2025-03-14 01:33:53,185 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-18: havoc ring_empty_#t~mem15#1; [2025-03-14 01:33:53,185 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-19: havoc ring_empty_#t~mem14#1; [2025-03-14 01:33:53,330 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:33:53,331 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:33:53,331 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:33:53,348 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:33:53,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:33:53 BoogieIcfgContainer [2025-03-14 01:33:53,348 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:33:53,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:33:53,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:33:53,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:33:53,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:33:52" (1/3) ... [2025-03-14 01:33:53,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7afe84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:33:53, skipping insertion in model container [2025-03-14 01:33:53,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:52" (2/3) ... [2025-03-14 01:33:53,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7afe84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:33:53, skipping insertion in model container [2025-03-14 01:33:53,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:33:53" (3/3) ... [2025-03-14 01:33:53,358 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2025-03-14 01:33:53,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:33:53,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ring_1w1r-2.i that has 2 procedures, 253 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-14 01:33:53,374 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:33:53,482 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:33:53,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 263 transitions, 533 flow [2025-03-14 01:33:53,610 INFO L124 PetriNetUnfolderBase]: 11/262 cut-off events. [2025-03-14 01:33:53,616 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:33:53,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 262 events. 11/262 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 552 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2025-03-14 01:33:53,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 263 transitions, 533 flow [2025-03-14 01:33:53,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 256 transitions, 515 flow [2025-03-14 01:33:53,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:33:53,656 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;@31252942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:33:53,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-14 01:33:53,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:33:53,665 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-14 01:33:53,665 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:33:53,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:53,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:53,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:33:53,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash -341371719, now seen corresponding path program 1 times [2025-03-14 01:33:53,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:53,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700583689] [2025-03-14 01:33:53,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:53,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:53,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:33:53,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:33:53,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:53,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:54,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700583689] [2025-03-14 01:33:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700583689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:54,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:54,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:54,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288119659] [2025-03-14 01:33:54,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:54,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:54,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:54,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:54,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:54,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2025-03-14 01:33:54,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 256 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:54,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:54,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2025-03-14 01:33:54,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:55,219 INFO L124 PetriNetUnfolderBase]: 908/4252 cut-off events. [2025-03-14 01:33:55,220 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:33:55,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5974 conditions, 4252 events. 908/4252 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33753 event pairs, 768 based on Foata normal form. 262/4107 useless extension candidates. Maximal degree in co-relation 5915. Up to 1713 conditions per place. [2025-03-14 01:33:55,244 INFO L140 encePairwiseOnDemand]: 250/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/245 dead transitions. [2025-03-14 01:33:55,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 245 transitions, 627 flow [2025-03-14 01:33:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2025-03-14 01:33:55,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7585551330798479 [2025-03-14 01:33:55,261 INFO L175 Difference]: Start difference. First operand has 249 places, 256 transitions, 515 flow. Second operand 6 states and 1197 transitions. [2025-03-14 01:33:55,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 245 transitions, 627 flow [2025-03-14 01:33:55,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 245 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:33:55,269 INFO L231 Difference]: Finished difference. Result has 249 places, 245 transitions, 502 flow [2025-03-14 01:33:55,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=249, PETRI_TRANSITIONS=245} [2025-03-14 01:33:55,275 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 0 predicate places. [2025-03-14 01:33:55,276 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 245 transitions, 502 flow [2025-03-14 01:33:55,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:55,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:55,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:55,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:33:55,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:33:55,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash 678699187, now seen corresponding path program 1 times [2025-03-14 01:33:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:55,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752647101] [2025-03-14 01:33:55,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:55,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:55,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:33:55,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:33:55,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:55,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:55,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752647101] [2025-03-14 01:33:55,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752647101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:55,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:55,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445388523] [2025-03-14 01:33:55,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:55,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:55,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:55,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:55,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:55,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2025-03-14 01:33:55,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 245 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:55,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:55,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2025-03-14 01:33:55,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:56,319 INFO L124 PetriNetUnfolderBase]: 908/4251 cut-off events. [2025-03-14 01:33:56,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:33:56,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 4251 events. 908/4251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33717 event pairs, 768 based on Foata normal form. 0/3845 useless extension candidates. Maximal degree in co-relation 5927. Up to 1713 conditions per place. [2025-03-14 01:33:56,337 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/244 dead transitions. [2025-03-14 01:33:56,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 634 flow [2025-03-14 01:33:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1190 transitions. [2025-03-14 01:33:56,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7541191381495564 [2025-03-14 01:33:56,342 INFO L175 Difference]: Start difference. First operand has 249 places, 245 transitions, 502 flow. Second operand 6 states and 1190 transitions. [2025-03-14 01:33:56,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 634 flow [2025-03-14 01:33:56,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 244 transitions, 624 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:33:56,348 INFO L231 Difference]: Finished difference. Result has 248 places, 244 transitions, 500 flow [2025-03-14 01:33:56,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=500, PETRI_PLACES=248, PETRI_TRANSITIONS=244} [2025-03-14 01:33:56,351 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, -1 predicate places. [2025-03-14 01:33:56,351 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 244 transitions, 500 flow [2025-03-14 01:33:56,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:56,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:56,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:56,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:33:56,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:33:56,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1962668552, now seen corresponding path program 1 times [2025-03-14 01:33:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:56,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103109777] [2025-03-14 01:33:56,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:56,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:56,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:33:56,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:33:56,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:56,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103109777] [2025-03-14 01:33:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103109777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:56,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343285306] [2025-03-14 01:33:56,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:56,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:56,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:56,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:57,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 263 [2025-03-14 01:33:57,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 244 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:57,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:57,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 263 [2025-03-14 01:33:57,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:57,367 INFO L124 PetriNetUnfolderBase]: 321/2321 cut-off events. [2025-03-14 01:33:57,367 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:33:57,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 2321 events. 321/2321 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16673 event pairs, 80 based on Foata normal form. 0/2061 useless extension candidates. Maximal degree in co-relation 2871. Up to 487 conditions per place. [2025-03-14 01:33:57,375 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 37 selfloop transitions, 44 changer transitions 0/286 dead transitions. [2025-03-14 01:33:57,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 286 transitions, 746 flow [2025-03-14 01:33:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-14 01:33:57,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8738910012674271 [2025-03-14 01:33:57,379 INFO L175 Difference]: Start difference. First operand has 248 places, 244 transitions, 500 flow. Second operand 6 states and 1379 transitions. [2025-03-14 01:33:57,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 286 transitions, 746 flow [2025-03-14 01:33:57,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 286 transitions, 736 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:33:57,384 INFO L231 Difference]: Finished difference. Result has 253 places, 286 transitions, 790 flow [2025-03-14 01:33:57,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=790, PETRI_PLACES=253, PETRI_TRANSITIONS=286} [2025-03-14 01:33:57,386 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 4 predicate places. [2025-03-14 01:33:57,386 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 286 transitions, 790 flow [2025-03-14 01:33:57,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:57,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:57,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:57,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:33:57,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:33:57,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1851313497, now seen corresponding path program 1 times [2025-03-14 01:33:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:57,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269177715] [2025-03-14 01:33:57,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:57,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:57,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-14 01:33:57,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-14 01:33:57,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:57,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:33:57,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:57,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269177715] [2025-03-14 01:33:57,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269177715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:57,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:57,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:57,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593059211] [2025-03-14 01:33:57,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:57,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:57,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:57,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:58,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 263 [2025-03-14 01:33:58,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 286 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:58,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:58,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 263 [2025-03-14 01:33:58,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:58,669 INFO L124 PetriNetUnfolderBase]: 506/4440 cut-off events. [2025-03-14 01:33:58,670 INFO L125 PetriNetUnfolderBase]: For 587/729 co-relation queries the response was YES. [2025-03-14 01:33:58,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 4440 events. 506/4440 cut-off events. For 587/729 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 37507 event pairs, 64 based on Foata normal form. 60/4126 useless extension candidates. Maximal degree in co-relation 6500. Up to 613 conditions per place. [2025-03-14 01:33:58,696 INFO L140 encePairwiseOnDemand]: 239/263 looper letters, 80 selfloop transitions, 41 changer transitions 0/332 dead transitions. [2025-03-14 01:33:58,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 332 transitions, 1160 flow [2025-03-14 01:33:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-03-14 01:33:58,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8593155893536122 [2025-03-14 01:33:58,702 INFO L175 Difference]: Start difference. First operand has 253 places, 286 transitions, 790 flow. Second operand 6 states and 1356 transitions. [2025-03-14 01:33:58,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 332 transitions, 1160 flow [2025-03-14 01:33:58,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 332 transitions, 1160 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:33:58,717 INFO L231 Difference]: Finished difference. Result has 263 places, 326 transitions, 1132 flow [2025-03-14 01:33:58,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1132, PETRI_PLACES=263, PETRI_TRANSITIONS=326} [2025-03-14 01:33:58,719 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2025-03-14 01:33:58,719 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 326 transitions, 1132 flow [2025-03-14 01:33:58,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:58,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:58,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:58,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:33:58,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr6ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:33:58,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash -618509025, now seen corresponding path program 1 times [2025-03-14 01:33:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413974453] [2025-03-14 01:33:58,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:58,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-14 01:33:58,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-14 01:33:58,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:58,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:33:58,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:58,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413974453] [2025-03-14 01:33:58,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413974453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:58,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:58,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787148298] [2025-03-14 01:33:58,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:58,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:58,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:58,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:58,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:59,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 263 [2025-03-14 01:33:59,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 326 transitions, 1132 flow. Second operand has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:59,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:59,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 263 [2025-03-14 01:33:59,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:59,960 INFO L124 PetriNetUnfolderBase]: 752/5256 cut-off events. [2025-03-14 01:33:59,961 INFO L125 PetriNetUnfolderBase]: For 2542/2941 co-relation queries the response was YES. [2025-03-14 01:33:59,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9544 conditions, 5256 events. 752/5256 cut-off events. For 2542/2941 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 45521 event pairs, 80 based on Foata normal form. 106/4984 useless extension candidates. Maximal degree in co-relation 9479. Up to 1011 conditions per place. [2025-03-14 01:33:59,987 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 95 selfloop transitions, 86 changer transitions 0/408 dead transitions. [2025-03-14 01:33:59,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 408 transitions, 1966 flow [2025-03-14 01:33:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-14 01:33:59,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8738910012674271 [2025-03-14 01:33:59,991 INFO L175 Difference]: Start difference. First operand has 263 places, 326 transitions, 1132 flow. Second operand 6 states and 1379 transitions. [2025-03-14 01:33:59,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 408 transitions, 1966 flow [2025-03-14 01:34:00,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 408 transitions, 1966 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:00,005 INFO L231 Difference]: Finished difference. Result has 273 places, 408 transitions, 2008 flow [2025-03-14 01:34:00,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2008, PETRI_PLACES=273, PETRI_TRANSITIONS=408} [2025-03-14 01:34:00,006 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 24 predicate places. [2025-03-14 01:34:00,007 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 408 transitions, 2008 flow [2025-03-14 01:34:00,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:00,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:00,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:00,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:34:00,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:34:00,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:00,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1969085332, now seen corresponding path program 1 times [2025-03-14 01:34:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:00,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627887714] [2025-03-14 01:34:00,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:00,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:00,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-14 01:34:00,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-14 01:34:00,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:00,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:34:00,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:00,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627887714] [2025-03-14 01:34:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627887714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:00,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50585236] [2025-03-14 01:34:00,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:00,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:00,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:00,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:00,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:00,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 263 [2025-03-14 01:34:00,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 408 transitions, 2008 flow. Second operand has 6 states, 6 states have (on average 231.66666666666666) internal successors, (1390), 6 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:00,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:00,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 263 [2025-03-14 01:34:00,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:01,238 INFO L124 PetriNetUnfolderBase]: 811/5931 cut-off events. [2025-03-14 01:34:01,239 INFO L125 PetriNetUnfolderBase]: For 6401/7112 co-relation queries the response was YES. [2025-03-14 01:34:01,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11795 conditions, 5931 events. 811/5931 cut-off events. For 6401/7112 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54108 event pairs, 51 based on Foata normal form. 213/5762 useless extension candidates. Maximal degree in co-relation 11725. Up to 704 conditions per place. [2025-03-14 01:34:01,272 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 98 selfloop transitions, 62 changer transitions 0/469 dead transitions. [2025-03-14 01:34:01,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 469 transitions, 2684 flow [2025-03-14 01:34:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1426 transitions. [2025-03-14 01:34:01,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9036755386565273 [2025-03-14 01:34:01,275 INFO L175 Difference]: Start difference. First operand has 273 places, 408 transitions, 2008 flow. Second operand 6 states and 1426 transitions. [2025-03-14 01:34:01,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 469 transitions, 2684 flow [2025-03-14 01:34:01,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 469 transitions, 2684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:01,297 INFO L231 Difference]: Finished difference. Result has 283 places, 466 transitions, 2676 flow [2025-03-14 01:34:01,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2676, PETRI_PLACES=283, PETRI_TRANSITIONS=466} [2025-03-14 01:34:01,299 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 34 predicate places. [2025-03-14 01:34:01,299 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 466 transitions, 2676 flow [2025-03-14 01:34:01,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.66666666666666) internal successors, (1390), 6 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:01,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:01,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:01,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:34:01,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:34:01,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -759013773, now seen corresponding path program 1 times [2025-03-14 01:34:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724902981] [2025-03-14 01:34:01,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:01,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-14 01:34:01,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-14 01:34:01,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:01,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:34:01,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:01,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724902981] [2025-03-14 01:34:01,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724902981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:01,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:01,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:01,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109718291] [2025-03-14 01:34:01,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:01,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:01,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:01,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:02,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 263 [2025-03-14 01:34:02,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 466 transitions, 2676 flow. Second operand has 6 states, 6 states have (on average 220.66666666666666) internal successors, (1324), 6 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:02,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:02,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 263 [2025-03-14 01:34:02,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:02,692 INFO L124 PetriNetUnfolderBase]: 1054/7178 cut-off events. [2025-03-14 01:34:02,692 INFO L125 PetriNetUnfolderBase]: For 10492/11185 co-relation queries the response was YES. [2025-03-14 01:34:02,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15798 conditions, 7178 events. 1054/7178 cut-off events. For 10492/11185 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 69488 event pairs, 80 based on Foata normal form. 132/6932 useless extension candidates. Maximal degree in co-relation 15723. Up to 1305 conditions per place. [2025-03-14 01:34:02,732 INFO L140 encePairwiseOnDemand]: 242/263 looper letters, 215 selfloop transitions, 70 changer transitions 0/531 dead transitions. [2025-03-14 01:34:02,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 531 transitions, 3684 flow [2025-03-14 01:34:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1392 transitions. [2025-03-14 01:34:02,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8821292775665399 [2025-03-14 01:34:02,738 INFO L175 Difference]: Start difference. First operand has 283 places, 466 transitions, 2676 flow. Second operand 6 states and 1392 transitions. [2025-03-14 01:34:02,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 531 transitions, 3684 flow [2025-03-14 01:34:02,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 531 transitions, 3684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:02,765 INFO L231 Difference]: Finished difference. Result has 293 places, 528 transitions, 3450 flow [2025-03-14 01:34:02,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2676, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3450, PETRI_PLACES=293, PETRI_TRANSITIONS=528} [2025-03-14 01:34:02,767 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 44 predicate places. [2025-03-14 01:34:02,767 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 528 transitions, 3450 flow [2025-03-14 01:34:02,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.66666666666666) internal successors, (1324), 6 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:02,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:02,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:02,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:34:02,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:34:02,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash 972241793, now seen corresponding path program 1 times [2025-03-14 01:34:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:02,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950323546] [2025-03-14 01:34:02,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:02,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:02,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-14 01:34:02,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:34:02,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:02,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:34:03,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:03,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950323546] [2025-03-14 01:34:03,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950323546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:03,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:03,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:03,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880421759] [2025-03-14 01:34:03,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:03,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:03,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:03,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:03,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 263 [2025-03-14 01:34:03,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 528 transitions, 3450 flow. Second operand has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:03,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:03,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 263 [2025-03-14 01:34:03,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:05,350 INFO L124 PetriNetUnfolderBase]: 4604/15132 cut-off events. [2025-03-14 01:34:05,351 INFO L125 PetriNetUnfolderBase]: For 17830/17968 co-relation queries the response was YES. [2025-03-14 01:34:05,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40812 conditions, 15132 events. 4604/15132 cut-off events. For 17830/17968 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 138671 event pairs, 2055 based on Foata normal form. 40/14408 useless extension candidates. Maximal degree in co-relation 40732. Up to 8616 conditions per place. [2025-03-14 01:34:05,429 INFO L140 encePairwiseOnDemand]: 224/263 looper letters, 301 selfloop transitions, 208 changer transitions 0/693 dead transitions. [2025-03-14 01:34:05,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 693 transitions, 5294 flow [2025-03-14 01:34:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1294 transitions. [2025-03-14 01:34:05,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200253485424588 [2025-03-14 01:34:05,433 INFO L175 Difference]: Start difference. First operand has 293 places, 528 transitions, 3450 flow. Second operand 6 states and 1294 transitions. [2025-03-14 01:34:05,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 693 transitions, 5294 flow [2025-03-14 01:34:05,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 693 transitions, 5122 flow, removed 86 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:05,500 INFO L231 Difference]: Finished difference. Result has 303 places, 693 transitions, 5070 flow [2025-03-14 01:34:05,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=3290, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5070, PETRI_PLACES=303, PETRI_TRANSITIONS=693} [2025-03-14 01:34:05,503 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 54 predicate places. [2025-03-14 01:34:05,504 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 693 transitions, 5070 flow [2025-03-14 01:34:05,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:05,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:05,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:05,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:34:05,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:34:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1764092554, now seen corresponding path program 1 times [2025-03-14 01:34:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245107744] [2025-03-14 01:34:05,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:05,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-14 01:34:05,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-14 01:34:05,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:05,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:34:05,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:05,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245107744] [2025-03-14 01:34:05,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245107744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:05,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:05,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:05,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752447234] [2025-03-14 01:34:05,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:05,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:05,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:05,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:05,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:06,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 263 [2025-03-14 01:34:06,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 693 transitions, 5070 flow. Second operand has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:06,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:06,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 263 [2025-03-14 01:34:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:07,484 INFO L124 PetriNetUnfolderBase]: 1706/9057 cut-off events. [2025-03-14 01:34:07,484 INFO L125 PetriNetUnfolderBase]: For 22025/23298 co-relation queries the response was YES. [2025-03-14 01:34:07,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24191 conditions, 9057 events. 1706/9057 cut-off events. For 22025/23298 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 88115 event pairs, 109 based on Foata normal form. 230/8893 useless extension candidates. Maximal degree in co-relation 24106. Up to 1674 conditions per place. [2025-03-14 01:34:07,550 INFO L140 encePairwiseOnDemand]: 248/263 looper letters, 311 selfloop transitions, 92 changer transitions 0/780 dead transitions. [2025-03-14 01:34:07,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 780 transitions, 6714 flow [2025-03-14 01:34:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-14 01:34:07,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8922686945500634 [2025-03-14 01:34:07,555 INFO L175 Difference]: Start difference. First operand has 303 places, 693 transitions, 5070 flow. Second operand 6 states and 1408 transitions. [2025-03-14 01:34:07,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 780 transitions, 6714 flow [2025-03-14 01:34:07,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 780 transitions, 6526 flow, removed 94 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:07,638 INFO L231 Difference]: Finished difference. Result has 313 places, 780 transitions, 6150 flow [2025-03-14 01:34:07,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=4882, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6150, PETRI_PLACES=313, PETRI_TRANSITIONS=780} [2025-03-14 01:34:07,639 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 64 predicate places. [2025-03-14 01:34:07,640 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 780 transitions, 6150 flow [2025-03-14 01:34:07,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:07,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:07,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:07,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:34:07,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:34:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1109589664, now seen corresponding path program 1 times [2025-03-14 01:34:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:07,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918221781] [2025-03-14 01:34:07,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:07,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-14 01:34:07,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:34:07,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:07,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:09,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918221781] [2025-03-14 01:34:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918221781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:09,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-14 01:34:09,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948422111] [2025-03-14 01:34:09,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:09,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 01:34:09,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:09,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 01:34:09,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-03-14 01:34:16,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 263 [2025-03-14 01:34:16,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 780 transitions, 6150 flow. Second operand has 26 states, 26 states have (on average 170.8846153846154) internal successors, (4443), 26 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:16,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:16,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 263 [2025-03-14 01:34:16,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:26,504 INFO L124 PetriNetUnfolderBase]: 9859/35960 cut-off events. [2025-03-14 01:34:26,505 INFO L125 PetriNetUnfolderBase]: For 76926/78343 co-relation queries the response was YES. [2025-03-14 01:34:26,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111240 conditions, 35960 events. 9859/35960 cut-off events. For 76926/78343 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 390667 event pairs, 1232 based on Foata normal form. 413/35111 useless extension candidates. Maximal degree in co-relation 111141. Up to 7504 conditions per place. [2025-03-14 01:34:26,762 INFO L140 encePairwiseOnDemand]: 217/263 looper letters, 1904 selfloop transitions, 317 changer transitions 14/2528 dead transitions. [2025-03-14 01:34:26,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 2528 transitions, 25524 flow [2025-03-14 01:34:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-14 01:34:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-03-14 01:34:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 10182 transitions. [2025-03-14 01:34:26,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6913362303096143 [2025-03-14 01:34:26,775 INFO L175 Difference]: Start difference. First operand has 313 places, 780 transitions, 6150 flow. Second operand 56 states and 10182 transitions. [2025-03-14 01:34:26,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 2528 transitions, 25524 flow [2025-03-14 01:34:27,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 2528 transitions, 24884 flow, removed 320 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:27,112 INFO L231 Difference]: Finished difference. Result has 408 places, 1157 transitions, 10066 flow [2025-03-14 01:34:27,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=5974, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=10066, PETRI_PLACES=408, PETRI_TRANSITIONS=1157} [2025-03-14 01:34:27,114 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 159 predicate places. [2025-03-14 01:34:27,114 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 1157 transitions, 10066 flow [2025-03-14 01:34:27,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 170.8846153846154) internal successors, (4443), 26 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:27,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:27,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:27,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:34:27,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:34:27,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1971524706, now seen corresponding path program 2 times [2025-03-14 01:34:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:27,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410633092] [2025-03-14 01:34:27,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:34:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:27,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:34:27,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:34:27,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:34:27,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410633092] [2025-03-14 01:34:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410633092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-14 01:34:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774736533] [2025-03-14 01:34:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 01:34:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:28,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 01:34:28,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-14 01:34:35,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 263 [2025-03-14 01:34:35,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 1157 transitions, 10066 flow. Second operand has 24 states, 24 states have (on average 179.79166666666666) internal successors, (4315), 24 states have internal predecessors, (4315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:35,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:35,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 263 [2025-03-14 01:34:35,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:47,757 INFO L124 PetriNetUnfolderBase]: 11567/45941 cut-off events. [2025-03-14 01:34:47,757 INFO L125 PetriNetUnfolderBase]: For 200988/204716 co-relation queries the response was YES. [2025-03-14 01:34:48,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160867 conditions, 45941 events. 11567/45941 cut-off events. For 200988/204716 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 537255 event pairs, 1035 based on Foata normal form. 813/45536 useless extension candidates. Maximal degree in co-relation 160720. Up to 12382 conditions per place. [2025-03-14 01:34:48,341 INFO L140 encePairwiseOnDemand]: 211/263 looper letters, 1340 selfloop transitions, 387 changer transitions 8/2154 dead transitions. [2025-03-14 01:34:48,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 2154 transitions, 22015 flow [2025-03-14 01:34:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 01:34:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 01:34:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6774 transitions. [2025-03-14 01:34:48,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7359043997827268 [2025-03-14 01:34:48,346 INFO L175 Difference]: Start difference. First operand has 408 places, 1157 transitions, 10066 flow. Second operand 35 states and 6774 transitions. [2025-03-14 01:34:48,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 2154 transitions, 22015 flow [2025-03-14 01:34:49,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 2154 transitions, 21980 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-14 01:34:49,765 INFO L231 Difference]: Finished difference. Result has 464 places, 1488 transitions, 15291 flow [2025-03-14 01:34:49,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=10035, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=15291, PETRI_PLACES=464, PETRI_TRANSITIONS=1488} [2025-03-14 01:34:49,766 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 215 predicate places. [2025-03-14 01:34:49,766 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 1488 transitions, 15291 flow [2025-03-14 01:34:49,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 179.79166666666666) internal successors, (4315), 24 states have internal predecessors, (4315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:49,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:49,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:49,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:34:49,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-14 01:34:49,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash 64492048, now seen corresponding path program 3 times [2025-03-14 01:34:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982083515] [2025-03-14 01:34:49,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:34:49,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:49,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:34:49,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:34:49,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:34:49,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:53,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982083515] [2025-03-14 01:34:53,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982083515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:53,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:53,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-14 01:34:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769364604] [2025-03-14 01:34:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:53,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-14 01:34:53,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:53,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-14 01:34:53,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2025-03-14 01:35:03,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 263 [2025-03-14 01:35:03,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 1488 transitions, 15291 flow. Second operand has 33 states, 33 states have (on average 127.78787878787878) internal successors, (4217), 33 states have internal predecessors, (4217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:03,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:03,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 263 [2025-03-14 01:35:03,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand