./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/ring_1w1r-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-divine/ring_1w1r-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3a956b76a4ba98ce13df4d83ef2fb7ffa0973225ecb152c14bcfbb55b6546601 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:20:51,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:20:51,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:20:51,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:20:51,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:20:51,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:20:51,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:20:51,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:20:51,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:20:51,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:20:51,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:20:51,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:20:51,334 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:20:51,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:20:51,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:20:51,334 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:20:51,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:20:51,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:20:51,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:20:51,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:20:51,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:20:51,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:20:51,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:20:51,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:20:51,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:20:51,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:20:51,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:20:51,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:20:51,337 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-jdk21/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 -> 3a956b76a4ba98ce13df4d83ef2fb7ffa0973225ecb152c14bcfbb55b6546601 [2025-01-09 21:20:51,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:20:51,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:20:51,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:20:51,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:20:51,618 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:20:51,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_1w1r-1.i [2025-01-09 21:20:53,033 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/279ec2d6a/b35d0d7f177e47c3adfb1c9dced7fbb2/FLAG34193eb6b [2025-01-09 21:20:53,365 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:20:53,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i [2025-01-09 21:20:53,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/279ec2d6a/b35d0d7f177e47c3adfb1c9dced7fbb2/FLAG34193eb6b [2025-01-09 21:20:53,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/279ec2d6a/b35d0d7f177e47c3adfb1c9dced7fbb2 [2025-01-09 21:20:53,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:20:53,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:20:53,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:20:53,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:20:53,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:20:53,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:20:53" (1/1) ... [2025-01-09 21:20:53,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cc6f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:53, skipping insertion in model container [2025-01-09 21:20:53,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:20:53" (1/1) ... [2025-01-09 21:20:53,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:20:53,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:20:53,948 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:20:53,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:20:54,028 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:20:54,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54 WrapperNode [2025-01-09 21:20:54,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:20:54,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:20:54,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:20:54,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:20:54,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,078 INFO L138 Inliner]: procedures = 224, calls = 44, calls flagged for inlining = 16, calls inlined = 10, statements flattened = 190 [2025-01-09 21:20:54,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:20:54,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:20:54,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:20:54,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:20:54,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,109 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:20:54,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:20:54,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:20:54,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:20:54,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (1/1) ... [2025-01-09 21:20:54,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:20:54,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:20:54,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:20:54,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:20:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:20:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:20:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:20:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:20:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:20:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:20:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure reader_nowait_fn [2025-01-09 21:20:54,190 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_nowait_fn [2025-01-09 21:20:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:20:54,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:20:54,191 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:20:54,332 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:20:54,334 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:20:54,671 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:20:54,671 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:20:54,686 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:20:54,686 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:20:54,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:20:54 BoogieIcfgContainer [2025-01-09 21:20:54,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:20:54,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:20:54,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:20:54,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:20:54,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:20:53" (1/3) ... [2025-01-09 21:20:54,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d49914c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:20:54, skipping insertion in model container [2025-01-09 21:20:54,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:54" (2/3) ... [2025-01-09 21:20:54,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d49914c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:20:54, skipping insertion in model container [2025-01-09 21:20:54,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:20:54" (3/3) ... [2025-01-09 21:20:54,699 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_1w1r-1.i [2025-01-09 21:20:54,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:20:54,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ring_1w1r-1.i that has 2 procedures, 226 locations, 1 initial locations, 3 loop locations, and 14 error locations. [2025-01-09 21:20:54,714 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:20:54,833 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:20:54,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 235 transitions, 477 flow [2025-01-09 21:20:54,948 INFO L124 PetriNetUnfolderBase]: 10/234 cut-off events. [2025-01-09 21:20:54,951 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:20:54,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 234 events. 10/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 521 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 184. Up to 2 conditions per place. [2025-01-09 21:20:54,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 235 transitions, 477 flow [2025-01-09 21:20:54,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 228 transitions, 459 flow [2025-01-09 21:20:54,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:20:55,000 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;@28b57b73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:20:55,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-09 21:20:55,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:20:55,013 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-01-09 21:20:55,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:20:55,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:55,014 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-01-09 21:20:55,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:20:55,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:55,022 INFO L85 PathProgramCache]: Analyzing trace with hash -201048023, now seen corresponding path program 1 times [2025-01-09 21:20:55,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:55,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101832200] [2025-01-09 21:20:55,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:55,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 21:20:55,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 21:20:55,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:55,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:55,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-01-09 21:20:55,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:55,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101832200] [2025-01-09 21:20:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101832200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:55,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:55,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:20:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362438406] [2025-01-09 21:20:55,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:55,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:20:55,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:55,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:20:55,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:20:55,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 235 [2025-01-09 21:20:55,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 228 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 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-01-09 21:20:55,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:55,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 235 [2025-01-09 21:20:55,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:56,512 INFO L124 PetriNetUnfolderBase]: 675/3079 cut-off events. [2025-01-09 21:20:56,513 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:20:56,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 3079 events. 675/3079 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 24244 event pairs, 576 based on Foata normal form. 206/2979 useless extension candidates. Maximal degree in co-relation 4315. Up to 1286 conditions per place. [2025-01-09 21:20:56,533 INFO L140 encePairwiseOnDemand]: 222/235 looper letters, 54 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-01-09 21:20:56,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 217 transitions, 555 flow [2025-01-09 21:20:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:20:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:20:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1069 transitions. [2025-01-09 21:20:56,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7581560283687944 [2025-01-09 21:20:56,554 INFO L175 Difference]: Start difference. First operand has 222 places, 228 transitions, 459 flow. Second operand 6 states and 1069 transitions. [2025-01-09 21:20:56,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 217 transitions, 555 flow [2025-01-09 21:20:56,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 217 transitions, 554 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:20:56,563 INFO L231 Difference]: Finished difference. Result has 222 places, 217 transitions, 446 flow [2025-01-09 21:20:56,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=222, PETRI_TRANSITIONS=217} [2025-01-09 21:20:56,569 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 0 predicate places. [2025-01-09 21:20:56,569 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 217 transitions, 446 flow [2025-01-09 21:20:56,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 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-01-09 21:20:56,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:56,570 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-01-09 21:20:56,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:20:56,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:20:56,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:56,572 INFO L85 PathProgramCache]: Analyzing trace with hash 528176234, now seen corresponding path program 1 times [2025-01-09 21:20:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:56,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495771216] [2025-01-09 21:20:56,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:56,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:56,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:20:56,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:20:56,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:56,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:56,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495771216] [2025-01-09 21:20:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495771216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:56,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:56,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:20:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38810718] [2025-01-09 21:20:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:56,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:20:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:56,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:20:56,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:20:57,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 235 [2025-01-09 21:20:57,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 217 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 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-01-09 21:20:57,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:57,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 235 [2025-01-09 21:20:57,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:57,691 INFO L124 PetriNetUnfolderBase]: 675/3078 cut-off events. [2025-01-09 21:20:57,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:20:57,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4378 conditions, 3078 events. 675/3078 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 24219 event pairs, 576 based on Foata normal form. 0/2773 useless extension candidates. Maximal degree in co-relation 4327. Up to 1286 conditions per place. [2025-01-09 21:20:57,719 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 54 selfloop transitions, 5 changer transitions 0/216 dead transitions. [2025-01-09 21:20:57,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 216 transitions, 562 flow [2025-01-09 21:20:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:20:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:20:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1062 transitions. [2025-01-09 21:20:57,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7531914893617021 [2025-01-09 21:20:57,728 INFO L175 Difference]: Start difference. First operand has 222 places, 217 transitions, 446 flow. Second operand 6 states and 1062 transitions. [2025-01-09 21:20:57,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 216 transitions, 562 flow [2025-01-09 21:20:57,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 216 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:20:57,731 INFO L231 Difference]: Finished difference. Result has 221 places, 216 transitions, 444 flow [2025-01-09 21:20:57,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=221, PETRI_TRANSITIONS=216} [2025-01-09 21:20:57,732 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -1 predicate places. [2025-01-09 21:20:57,732 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 216 transitions, 444 flow [2025-01-09 21:20:57,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 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-01-09 21:20:57,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:57,733 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-01-09 21:20:57,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:20:57,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:20:57,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1762380594, now seen corresponding path program 1 times [2025-01-09 21:20:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758133518] [2025-01-09 21:20:57,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:57,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:57,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:20:57,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:20:57,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:57,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758133518] [2025-01-09 21:20:58,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758133518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:58,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:58,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:20:58,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82511966] [2025-01-09 21:20:58,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:58,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:20:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:58,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:20:58,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:20:58,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 235 [2025-01-09 21:20:58,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 216 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 192.66666666666666) internal successors, (1156), 6 states have internal predecessors, (1156), 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-01-09 21:20:58,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:58,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 235 [2025-01-09 21:20:58,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:58,663 INFO L124 PetriNetUnfolderBase]: 311/2118 cut-off events. [2025-01-09 21:20:58,663 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:20:58,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 2118 events. 311/2118 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14674 event pairs, 64 based on Foata normal form. 0/1898 useless extension candidates. Maximal degree in co-relation 2665. Up to 452 conditions per place. [2025-01-09 21:20:58,669 INFO L140 encePairwiseOnDemand]: 214/235 looper letters, 39 selfloop transitions, 43 changer transitions 0/261 dead transitions. [2025-01-09 21:20:58,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 261 transitions, 698 flow [2025-01-09 21:20:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:20:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:20:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2025-01-09 21:20:58,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8680851063829788 [2025-01-09 21:20:58,672 INFO L175 Difference]: Start difference. First operand has 221 places, 216 transitions, 444 flow. Second operand 6 states and 1224 transitions. [2025-01-09 21:20:58,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 261 transitions, 698 flow [2025-01-09 21:20:58,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 261 transitions, 688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:20:58,678 INFO L231 Difference]: Finished difference. Result has 226 places, 258 transitions, 730 flow [2025-01-09 21:20:58,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=730, PETRI_PLACES=226, PETRI_TRANSITIONS=258} [2025-01-09 21:20:58,679 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 4 predicate places. [2025-01-09 21:20:58,679 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 258 transitions, 730 flow [2025-01-09 21:20:58,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.66666666666666) internal successors, (1156), 6 states have internal predecessors, (1156), 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-01-09 21:20:58,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:58,679 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] [2025-01-09 21:20:58,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:20:58,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:20:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash -188836747, now seen corresponding path program 1 times [2025-01-09 21:20:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90642747] [2025-01-09 21:20:58,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:58,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:20:58,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:20:58,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:58,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:20:58,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:58,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90642747] [2025-01-09 21:20:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90642747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:20:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72854172] [2025-01-09 21:20:58,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:58,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:20:58,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:58,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:20:58,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:20:58,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 235 [2025-01-09 21:20:58,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 258 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-01-09 21:20:58,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:58,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 235 [2025-01-09 21:20:58,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:58,888 INFO L124 PetriNetUnfolderBase]: 281/2353 cut-off events. [2025-01-09 21:20:58,888 INFO L125 PetriNetUnfolderBase]: For 236/268 co-relation queries the response was YES. [2025-01-09 21:20:58,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3430 conditions, 2353 events. 281/2353 cut-off events. For 236/268 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 16906 event pairs, 16 based on Foata normal form. 1/2156 useless extension candidates. Maximal degree in co-relation 3378. Up to 340 conditions per place. [2025-01-09 21:20:58,899 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 3 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-01-09 21:20:58,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 259 transitions, 742 flow [2025-01-09 21:20:58,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:20:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:20:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2025-01-09 21:20:58,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9574468085106383 [2025-01-09 21:20:58,901 INFO L175 Difference]: Start difference. First operand has 226 places, 258 transitions, 730 flow. Second operand 3 states and 675 transitions. [2025-01-09 21:20:58,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 259 transitions, 742 flow [2025-01-09 21:20:58,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 259 transitions, 742 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:20:58,906 INFO L231 Difference]: Finished difference. Result has 229 places, 259 transitions, 742 flow [2025-01-09 21:20:58,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=229, PETRI_TRANSITIONS=259} [2025-01-09 21:20:58,906 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 7 predicate places. [2025-01-09 21:20:58,906 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 259 transitions, 742 flow [2025-01-09 21:20:58,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-01-09 21:20:58,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:58,907 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-01-09 21:20:58,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:20:58,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:20:58,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash 703056184, now seen corresponding path program 1 times [2025-01-09 21:20:58,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:58,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844207711] [2025-01-09 21:20:58,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:58,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:58,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:20:58,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:20:58,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:58,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:20:59,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:59,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844207711] [2025-01-09 21:20:59,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844207711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:59,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:59,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:20:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117057612] [2025-01-09 21:20:59,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:59,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:20:59,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:59,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:20:59,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:20:59,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 235 [2025-01-09 21:20:59,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 259 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 186.66666666666666) internal successors, (1120), 6 states have internal predecessors, (1120), 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-01-09 21:20:59,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:59,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 235 [2025-01-09 21:20:59,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:59,971 INFO L124 PetriNetUnfolderBase]: 768/4977 cut-off events. [2025-01-09 21:20:59,971 INFO L125 PetriNetUnfolderBase]: For 1024/1190 co-relation queries the response was YES. [2025-01-09 21:20:59,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 4977 events. 768/4977 cut-off events. For 1024/1190 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 43649 event pairs, 132 based on Foata normal form. 68/4712 useless extension candidates. Maximal degree in co-relation 8146. Up to 1059 conditions per place. [2025-01-09 21:20:59,990 INFO L140 encePairwiseOnDemand]: 211/235 looper letters, 81 selfloop transitions, 45 changer transitions 0/309 dead transitions. [2025-01-09 21:20:59,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 309 transitions, 1154 flow [2025-01-09 21:20:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:20:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:20:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1188 transitions. [2025-01-09 21:20:59,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425531914893617 [2025-01-09 21:20:59,993 INFO L175 Difference]: Start difference. First operand has 229 places, 259 transitions, 742 flow. Second operand 6 states and 1188 transitions. [2025-01-09 21:20:59,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 309 transitions, 1154 flow [2025-01-09 21:20:59,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 309 transitions, 1152 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:20:59,998 INFO L231 Difference]: Finished difference. Result has 238 places, 303 transitions, 1132 flow [2025-01-09 21:20:59,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1132, PETRI_PLACES=238, PETRI_TRANSITIONS=303} [2025-01-09 21:20:59,999 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 16 predicate places. [2025-01-09 21:20:59,999 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 303 transitions, 1132 flow [2025-01-09 21:21:00,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.66666666666666) internal successors, (1120), 6 states have internal predecessors, (1120), 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-01-09 21:21:00,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:00,000 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-01-09 21:21:00,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:21:00,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:00,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:00,001 INFO L85 PathProgramCache]: Analyzing trace with hash 488407033, now seen corresponding path program 1 times [2025-01-09 21:21:00,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:00,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823581148] [2025-01-09 21:21:00,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:00,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:21:00,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:21:00,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:00,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:21:00,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:00,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823581148] [2025-01-09 21:21:00,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823581148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:00,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:00,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115459185] [2025-01-09 21:21:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:21:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:00,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:21:00,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:21:00,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 235 [2025-01-09 21:21:00,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 303 transitions, 1132 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 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-01-09 21:21:00,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:00,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 235 [2025-01-09 21:21:00,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:01,252 INFO L124 PetriNetUnfolderBase]: 1108/6651 cut-off events. [2025-01-09 21:21:01,252 INFO L125 PetriNetUnfolderBase]: For 5104/5993 co-relation queries the response was YES. [2025-01-09 21:21:01,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12895 conditions, 6651 events. 1108/6651 cut-off events. For 5104/5993 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 61694 event pairs, 156 based on Foata normal form. 167/6399 useless extension candidates. Maximal degree in co-relation 12829. Up to 1419 conditions per place. [2025-01-09 21:21:01,289 INFO L140 encePairwiseOnDemand]: 220/235 looper letters, 94 selfloop transitions, 78 changer transitions 0/380 dead transitions. [2025-01-09 21:21:01,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 380 transitions, 1934 flow [2025-01-09 21:21:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:21:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:21:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1240 transitions. [2025-01-09 21:21:01,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-01-09 21:21:01,293 INFO L175 Difference]: Start difference. First operand has 238 places, 303 transitions, 1132 flow. Second operand 6 states and 1240 transitions. [2025-01-09 21:21:01,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 380 transitions, 1934 flow [2025-01-09 21:21:01,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 380 transitions, 1934 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:21:01,314 INFO L231 Difference]: Finished difference. Result has 248 places, 380 transitions, 1950 flow [2025-01-09 21:21:01,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1950, PETRI_PLACES=248, PETRI_TRANSITIONS=380} [2025-01-09 21:21:01,315 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 26 predicate places. [2025-01-09 21:21:01,315 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 380 transitions, 1950 flow [2025-01-09 21:21:01,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 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-01-09 21:21:01,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:01,317 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-01-09 21:21:01,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:21:01,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:01,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1870241765, now seen corresponding path program 1 times [2025-01-09 21:21:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:01,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910019069] [2025-01-09 21:21:01,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:01,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:01,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:21:01,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:21:01,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:01,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:21:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:01,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910019069] [2025-01-09 21:21:01,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910019069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:01,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257882476] [2025-01-09 21:21:01,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:01,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:21:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:01,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:21:01,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:21:02,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 235 [2025-01-09 21:21:02,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 380 transitions, 1950 flow. Second operand has 6 states, 6 states have (on average 203.66666666666666) internal successors, (1222), 6 states have internal predecessors, (1222), 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-01-09 21:21:02,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:02,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 235 [2025-01-09 21:21:02,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:03,333 INFO L124 PetriNetUnfolderBase]: 1208/7265 cut-off events. [2025-01-09 21:21:03,334 INFO L125 PetriNetUnfolderBase]: For 6073/6641 co-relation queries the response was YES. [2025-01-09 21:21:03,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15035 conditions, 7265 events. 1208/7265 cut-off events. For 6073/6641 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 69205 event pairs, 107 based on Foata normal form. 192/7075 useless extension candidates. Maximal degree in co-relation 14964. Up to 1086 conditions per place. [2025-01-09 21:21:03,388 INFO L140 encePairwiseOnDemand]: 224/235 looper letters, 103 selfloop transitions, 66 changer transitions 0/445 dead transitions. [2025-01-09 21:21:03,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 445 transitions, 2720 flow [2025-01-09 21:21:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:21:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:21:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1258 transitions. [2025-01-09 21:21:03,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8921985815602836 [2025-01-09 21:21:03,392 INFO L175 Difference]: Start difference. First operand has 248 places, 380 transitions, 1950 flow. Second operand 6 states and 1258 transitions. [2025-01-09 21:21:03,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 445 transitions, 2720 flow [2025-01-09 21:21:03,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 445 transitions, 2720 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:21:03,417 INFO L231 Difference]: Finished difference. Result has 258 places, 442 transitions, 2712 flow [2025-01-09 21:21:03,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2712, PETRI_PLACES=258, PETRI_TRANSITIONS=442} [2025-01-09 21:21:03,418 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 36 predicate places. [2025-01-09 21:21:03,418 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 442 transitions, 2712 flow [2025-01-09 21:21:03,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.66666666666666) internal successors, (1222), 6 states have internal predecessors, (1222), 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-01-09 21:21:03,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:03,419 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] [2025-01-09 21:21:03,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:21:03,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reader_nowait_fnErr3ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:03,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash -653717878, now seen corresponding path program 1 times [2025-01-09 21:21:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977403714] [2025-01-09 21:21:03,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:03,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:21:03,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:21:03,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:03,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:21:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977403714] [2025-01-09 21:21:03,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977403714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:03,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:03,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528223185] [2025-01-09 21:21:03,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:03,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:21:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:03,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:21:03,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:21:03,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 235 [2025-01-09 21:21:03,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 442 transitions, 2712 flow. Second operand has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 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-01-09 21:21:03,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:03,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 235 [2025-01-09 21:21:03,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:05,784 INFO L124 PetriNetUnfolderBase]: 5261/16665 cut-off events. [2025-01-09 21:21:05,784 INFO L125 PetriNetUnfolderBase]: For 19061/19361 co-relation queries the response was YES. [2025-01-09 21:21:05,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44613 conditions, 16665 events. 5261/16665 cut-off events. For 19061/19361 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 158484 event pairs, 2287 based on Foata normal form. 50/15799 useless extension candidates. Maximal degree in co-relation 44537. Up to 9666 conditions per place. [2025-01-09 21:21:05,859 INFO L140 encePairwiseOnDemand]: 204/235 looper letters, 260 selfloop transitions, 156 changer transitions 0/573 dead transitions. [2025-01-09 21:21:05,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 573 transitions, 4280 flow [2025-01-09 21:21:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:21:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:21:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1134 transitions. [2025-01-09 21:21:05,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8042553191489362 [2025-01-09 21:21:05,862 INFO L175 Difference]: Start difference. First operand has 258 places, 442 transitions, 2712 flow. Second operand 6 states and 1134 transitions. [2025-01-09 21:21:05,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 573 transitions, 4280 flow [2025-01-09 21:21:05,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 573 transitions, 4280 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:21:05,929 INFO L231 Difference]: Finished difference. Result has 268 places, 573 transitions, 4180 flow [2025-01-09 21:21:05,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2712, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4180, PETRI_PLACES=268, PETRI_TRANSITIONS=573} [2025-01-09 21:21:05,931 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 46 predicate places. [2025-01-09 21:21:05,932 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 573 transitions, 4180 flow [2025-01-09 21:21:05,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 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-01-09 21:21:05,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:05,932 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-01-09 21:21:05,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:21:05,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:05,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:05,933 INFO L85 PathProgramCache]: Analyzing trace with hash -191139568, now seen corresponding path program 1 times [2025-01-09 21:21:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:05,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515680086] [2025-01-09 21:21:05,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:05,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:05,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:21:05,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:21:05,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:05,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:21:06,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515680086] [2025-01-09 21:21:06,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515680086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:06,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:06,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:06,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442876106] [2025-01-09 21:21:06,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:21:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:06,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:21:06,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:21:06,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 235 [2025-01-09 21:21:06,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 573 transitions, 4180 flow. Second operand has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 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-01-09 21:21:06,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:06,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 235 [2025-01-09 21:21:06,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:08,771 INFO L124 PetriNetUnfolderBase]: 5567/17507 cut-off events. [2025-01-09 21:21:08,771 INFO L125 PetriNetUnfolderBase]: For 29363/29617 co-relation queries the response was YES. [2025-01-09 21:21:08,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52930 conditions, 17507 events. 5567/17507 cut-off events. For 29363/29617 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 167517 event pairs, 2232 based on Foata normal form. 12/16658 useless extension candidates. Maximal degree in co-relation 52849. Up to 9984 conditions per place. [2025-01-09 21:21:08,857 INFO L140 encePairwiseOnDemand]: 204/235 looper letters, 372 selfloop transitions, 167 changer transitions 0/700 dead transitions. [2025-01-09 21:21:08,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 700 transitions, 5924 flow [2025-01-09 21:21:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:21:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:21:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1134 transitions. [2025-01-09 21:21:08,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8042553191489362 [2025-01-09 21:21:08,860 INFO L175 Difference]: Start difference. First operand has 268 places, 573 transitions, 4180 flow. Second operand 6 states and 1134 transitions. [2025-01-09 21:21:08,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 700 transitions, 5924 flow [2025-01-09 21:21:08,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 700 transitions, 5692 flow, removed 116 selfloop flow, removed 0 redundant places. [2025-01-09 21:21:08,939 INFO L231 Difference]: Finished difference. Result has 278 places, 700 transitions, 5388 flow [2025-01-09 21:21:08,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3960, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5388, PETRI_PLACES=278, PETRI_TRANSITIONS=700} [2025-01-09 21:21:08,940 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 56 predicate places. [2025-01-09 21:21:08,941 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 700 transitions, 5388 flow [2025-01-09 21:21:08,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 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-01-09 21:21:08,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:08,942 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-01-09 21:21:08,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:21:08,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:08,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:08,942 INFO L85 PathProgramCache]: Analyzing trace with hash 436913471, now seen corresponding path program 1 times [2025-01-09 21:21:08,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:08,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365572843] [2025-01-09 21:21:08,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:08,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:08,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:21:08,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:21:08,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:08,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:21:11,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:11,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365572843] [2025-01-09 21:21:11,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365572843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:11,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:11,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-01-09 21:21:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61709779] [2025-01-09 21:21:11,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:11,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 21:21:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:11,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 21:21:11,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-01-09 21:21:15,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 235 [2025-01-09 21:21:15,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 700 transitions, 5388 flow. Second operand has 24 states, 24 states have (on average 155.66666666666666) internal successors, (3736), 24 states have internal predecessors, (3736), 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-01-09 21:21:15,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:15,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 235 [2025-01-09 21:21:15,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:20,184 INFO L124 PetriNetUnfolderBase]: 6291/25454 cut-off events. [2025-01-09 21:21:20,185 INFO L125 PetriNetUnfolderBase]: For 53023/54482 co-relation queries the response was YES. [2025-01-09 21:21:20,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75321 conditions, 25454 events. 6291/25454 cut-off events. For 53023/54482 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 289038 event pairs, 825 based on Foata normal form. 329/24746 useless extension candidates. Maximal degree in co-relation 75227. Up to 7429 conditions per place. [2025-01-09 21:21:20,353 INFO L140 encePairwiseOnDemand]: 196/235 looper letters, 976 selfloop transitions, 193 changer transitions 0/1447 dead transitions. [2025-01-09 21:21:20,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1447 transitions, 13948 flow [2025-01-09 21:21:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 21:21:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-01-09 21:21:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5762 transitions. [2025-01-09 21:21:20,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7005471124620061 [2025-01-09 21:21:20,361 INFO L175 Difference]: Start difference. First operand has 278 places, 700 transitions, 5388 flow. Second operand 35 states and 5762 transitions. [2025-01-09 21:21:20,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1447 transitions, 13948 flow [2025-01-09 21:21:20,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 1447 transitions, 13792 flow, removed 78 selfloop flow, removed 0 redundant places. [2025-01-09 21:21:20,780 INFO L231 Difference]: Finished difference. Result has 337 places, 901 transitions, 8389 flow [2025-01-09 21:21:20,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5232, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=8389, PETRI_PLACES=337, PETRI_TRANSITIONS=901} [2025-01-09 21:21:20,781 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 115 predicate places. [2025-01-09 21:21:20,781 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 901 transitions, 8389 flow [2025-01-09 21:21:20,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 155.66666666666666) internal successors, (3736), 24 states have internal predecessors, (3736), 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-01-09 21:21:20,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:20,782 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-01-09 21:21:20,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:21:20,783 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:20,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash -730862909, now seen corresponding path program 2 times [2025-01-09 21:21:20,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:20,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185437093] [2025-01-09 21:21:20,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:21:20,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:20,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-09 21:21:20,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 86 of 95 statements. [2025-01-09 21:21:20,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:21:20,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:21:23,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:23,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185437093] [2025-01-09 21:21:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185437093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:23,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 21:21:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377755437] [2025-01-09 21:21:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:23,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 21:21:23,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:23,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 21:21:23,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-01-09 21:21:26,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 235 [2025-01-09 21:21:26,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 901 transitions, 8389 flow. Second operand has 20 states, 20 states have (on average 162.65) internal successors, (3253), 20 states have internal predecessors, (3253), 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-01-09 21:21:26,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:26,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 235 [2025-01-09 21:21:26,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:43,871 INFO L124 PetriNetUnfolderBase]: 23465/86498 cut-off events. [2025-01-09 21:21:43,871 INFO L125 PetriNetUnfolderBase]: For 257418/265126 co-relation queries the response was YES. [2025-01-09 21:21:44,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288038 conditions, 86498 events. 23465/86498 cut-off events. For 257418/265126 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 1169561 event pairs, 4115 based on Foata normal form. 1154/84571 useless extension candidates. Maximal degree in co-relation 287917. Up to 12635 conditions per place. [2025-01-09 21:21:44,833 INFO L140 encePairwiseOnDemand]: 194/235 looper letters, 2082 selfloop transitions, 244 changer transitions 0/2618 dead transitions. [2025-01-09 21:21:44,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 2618 transitions, 30225 flow [2025-01-09 21:21:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 21:21:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 21:21:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3144 transitions. [2025-01-09 21:21:44,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7869837296620776 [2025-01-09 21:21:44,844 INFO L175 Difference]: Start difference. First operand has 337 places, 901 transitions, 8389 flow. Second operand 17 states and 3144 transitions. [2025-01-09 21:21:44,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 2618 transitions, 30225 flow [2025-01-09 21:21:46,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 2618 transitions, 30184 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-01-09 21:21:46,464 INFO L231 Difference]: Finished difference. Result has 360 places, 1138 transitions, 13118 flow [2025-01-09 21:21:46,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=8348, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=13118, PETRI_PLACES=360, PETRI_TRANSITIONS=1138} [2025-01-09 21:21:46,465 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 138 predicate places. [2025-01-09 21:21:46,465 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 1138 transitions, 13118 flow [2025-01-09 21:21:46,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 162.65) internal successors, (3253), 20 states have internal predecessors, (3253), 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-01-09 21:21:46,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:46,467 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-01-09 21:21:46,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:21:46,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:21:46,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:46,467 INFO L85 PathProgramCache]: Analyzing trace with hash 152274833, now seen corresponding path program 3 times [2025-01-09 21:21:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:46,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065140273] [2025-01-09 21:21:46,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:21:46,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:46,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 3 equivalence classes. [2025-01-09 21:21:46,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 86 of 95 statements. [2025-01-09 21:21:46,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:21:46,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:21:47,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:47,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065140273] [2025-01-09 21:21:47,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065140273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:47,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:47,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 21:21:47,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697528983] [2025-01-09 21:21:47,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:47,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:21:47,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:47,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:21:47,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:21:49,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 235 [2025-01-09 21:21:49,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 1138 transitions, 13118 flow. Second operand has 18 states, 18 states have (on average 166.61111111111111) internal successors, (2999), 18 states have internal predecessors, (2999), 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-01-09 21:21:49,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:49,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 235 [2025-01-09 21:21:49,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand