./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:14:11,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:14:11,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:14:11,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:14:11,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:14:11,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:14:11,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:14:11,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:14:11,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:14:11,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:14:11,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:14:11,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:14:11,866 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:14:11,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:14:11,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:14:11,866 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:14:11,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:14:11,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:14:11,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:14:11,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:14:11,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:14:11,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:14:11,867 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:14:11,867 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:14:11,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:14:11,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:14:11,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:14:11,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:14:11,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:14:11,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:14:11,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:14:11,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:14:11,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:14:11,869 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b [2025-03-13 22:14:12,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:14:12,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:14:12,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:14:12,127 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:14:12,127 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:14:12,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-03-13 22:14:13,262 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45329d5d4/be251428f59446149bf0cde2c01a4be3/FLAG121a3c780 [2025-03-13 22:14:13,541 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:14:13,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-03-13 22:14:13,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45329d5d4/be251428f59446149bf0cde2c01a4be3/FLAG121a3c780 [2025-03-13 22:14:13,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45329d5d4/be251428f59446149bf0cde2c01a4be3 [2025-03-13 22:14:13,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:14:13,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:14:13,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:14:13,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:14:13,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:14:13,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:14:13" (1/1) ... [2025-03-13 22:14:13,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bef00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:13, skipping insertion in model container [2025-03-13 22:14:13,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:14:13" (1/1) ... [2025-03-13 22:14:13,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:14:14,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:14:14,164 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:14:14,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:14:14,263 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:14:14,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14 WrapperNode [2025-03-13 22:14:14,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:14:14,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:14:14,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:14:14,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:14:14,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,317 INFO L138 Inliner]: procedures = 223, calls = 39, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 215 [2025-03-13 22:14:14,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:14:14,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:14:14,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:14:14,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:14:14,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:14:14,359 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:14:14,359 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:14:14,361 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:14:14,362 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (1/1) ... [2025-03-13 22:14:14,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:14:14,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:14:14,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:14:14,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:14:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2025-03-13 22:14:14,416 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2025-03-13 22:14:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:14:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:14:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:14:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:14:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:14:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:14:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:14:14,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:14:14,418 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:14:14,501 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:14:14,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:14:14,702 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc ring_empty_#t~mem15#1; [2025-03-13 22:14:14,706 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-1: havoc ring_empty_#t~mem14#1; [2025-03-13 22:14:14,706 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-18: havoc ring_empty_#t~mem15#1; [2025-03-13 22:14:14,706 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-19: havoc ring_empty_#t~mem14#1; [2025-03-13 22:14:14,838 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:14:14,839 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:14:14,839 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:14:14,850 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:14:14,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:14:14 BoogieIcfgContainer [2025-03-13 22:14:14,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:14:14,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:14:14,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:14:14,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:14:14,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:14:13" (1/3) ... [2025-03-13 22:14:14,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c5f4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:14:14, skipping insertion in model container [2025-03-13 22:14:14,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:14" (2/3) ... [2025-03-13 22:14:14,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c5f4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:14:14, skipping insertion in model container [2025-03-13 22:14:14,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:14:14" (3/3) ... [2025-03-13 22:14:14,857 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2025-03-13 22:14:14,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:14:14,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ring_1w1r-2.i that has 2 procedures, 253 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-13 22:14:14,872 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:14:14,966 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:14:14,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 263 transitions, 533 flow [2025-03-13 22:14:15,096 INFO L124 PetriNetUnfolderBase]: 11/262 cut-off events. [2025-03-13 22:14:15,099 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:14:15,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 262 events. 11/262 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 552 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2025-03-13 22:14:15,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 263 transitions, 533 flow [2025-03-13 22:14:15,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 256 transitions, 515 flow [2025-03-13 22:14:15,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:14:15,129 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;@7e631b07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:14:15,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-13 22:14:15,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:14:15,139 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-13 22:14:15,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:14:15,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:15,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:15,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:15,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash -341371719, now seen corresponding path program 1 times [2025-03-13 22:14:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:15,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720612020] [2025-03-13 22:14:15,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:15,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:15,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 22:14:15,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 22:14:15,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:15,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:14:15,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:15,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720612020] [2025-03-13 22:14:15,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720612020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:15,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:15,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:15,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077534273] [2025-03-13 22:14:15,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:15,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:15,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:15,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:15,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:16,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2025-03-13 22:14:16,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 256 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:16,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:16,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2025-03-13 22:14:16,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:16,674 INFO L124 PetriNetUnfolderBase]: 908/4252 cut-off events. [2025-03-13 22:14:16,674 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:14:16,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5974 conditions, 4252 events. 908/4252 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33753 event pairs, 768 based on Foata normal form. 262/4107 useless extension candidates. Maximal degree in co-relation 5915. Up to 1713 conditions per place. [2025-03-13 22:14:16,692 INFO L140 encePairwiseOnDemand]: 250/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/245 dead transitions. [2025-03-13 22:14:16,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 245 transitions, 627 flow [2025-03-13 22:14:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2025-03-13 22:14:16,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7585551330798479 [2025-03-13 22:14:16,706 INFO L175 Difference]: Start difference. First operand has 249 places, 256 transitions, 515 flow. Second operand 6 states and 1197 transitions. [2025-03-13 22:14:16,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 245 transitions, 627 flow [2025-03-13 22:14:16,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 245 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:14:16,741 INFO L231 Difference]: Finished difference. Result has 249 places, 245 transitions, 502 flow [2025-03-13 22:14:16,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=249, PETRI_TRANSITIONS=245} [2025-03-13 22:14:16,745 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 0 predicate places. [2025-03-13 22:14:16,746 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 245 transitions, 502 flow [2025-03-13 22:14:16,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:16,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:16,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:16,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:14:16,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:16,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash 678699187, now seen corresponding path program 1 times [2025-03-13 22:14:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:16,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618277970] [2025-03-13 22:14:16,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:16,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:14:16,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:14:16,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:16,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:14:17,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:17,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618277970] [2025-03-13 22:14:17,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618277970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:17,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164778677] [2025-03-13 22:14:17,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:17,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:17,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:17,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:17,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2025-03-13 22:14:17,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 245 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:17,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:17,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2025-03-13 22:14:17,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:17,729 INFO L124 PetriNetUnfolderBase]: 908/4251 cut-off events. [2025-03-13 22:14:17,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:14:17,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 4251 events. 908/4251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33717 event pairs, 768 based on Foata normal form. 0/3845 useless extension candidates. Maximal degree in co-relation 5927. Up to 1713 conditions per place. [2025-03-13 22:14:17,747 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/244 dead transitions. [2025-03-13 22:14:17,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 634 flow [2025-03-13 22:14:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1190 transitions. [2025-03-13 22:14:17,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7541191381495564 [2025-03-13 22:14:17,753 INFO L175 Difference]: Start difference. First operand has 249 places, 245 transitions, 502 flow. Second operand 6 states and 1190 transitions. [2025-03-13 22:14:17,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 634 flow [2025-03-13 22:14:17,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 244 transitions, 624 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:14:17,758 INFO L231 Difference]: Finished difference. Result has 248 places, 244 transitions, 500 flow [2025-03-13 22:14:17,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=500, PETRI_PLACES=248, PETRI_TRANSITIONS=244} [2025-03-13 22:14:17,761 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, -1 predicate places. [2025-03-13 22:14:17,761 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 244 transitions, 500 flow [2025-03-13 22:14:17,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:17,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:17,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:17,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:14:17,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:17,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1962668552, now seen corresponding path program 1 times [2025-03-13 22:14:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661993909] [2025-03-13 22:14:17,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:17,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:14:17,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:14:17,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:17,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:14:18,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661993909] [2025-03-13 22:14:18,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661993909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:18,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:18,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:18,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982249120] [2025-03-13 22:14:18,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:18,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:18,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:18,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:18,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:18,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 263 [2025-03-13 22:14:18,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 244 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:18,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:18,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 263 [2025-03-13 22:14:18,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:18,732 INFO L124 PetriNetUnfolderBase]: 321/2321 cut-off events. [2025-03-13 22:14:18,733 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:14:18,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 2321 events. 321/2321 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16673 event pairs, 80 based on Foata normal form. 0/2061 useless extension candidates. Maximal degree in co-relation 2871. Up to 487 conditions per place. [2025-03-13 22:14:18,743 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 37 selfloop transitions, 44 changer transitions 0/286 dead transitions. [2025-03-13 22:14:18,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 286 transitions, 746 flow [2025-03-13 22:14:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-13 22:14:18,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8738910012674271 [2025-03-13 22:14:18,746 INFO L175 Difference]: Start difference. First operand has 248 places, 244 transitions, 500 flow. Second operand 6 states and 1379 transitions. [2025-03-13 22:14:18,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 286 transitions, 746 flow [2025-03-13 22:14:18,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 286 transitions, 736 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:14:18,754 INFO L231 Difference]: Finished difference. Result has 253 places, 286 transitions, 790 flow [2025-03-13 22:14:18,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=790, PETRI_PLACES=253, PETRI_TRANSITIONS=286} [2025-03-13 22:14:18,755 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 4 predicate places. [2025-03-13 22:14:18,755 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 286 transitions, 790 flow [2025-03-13 22:14:18,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:18,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:18,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:18,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:14:18,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:18,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:18,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1851313497, now seen corresponding path program 1 times [2025-03-13 22:14:18,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:18,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14717143] [2025-03-13 22:14:18,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:18,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:18,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 22:14:18,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 22:14:18,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:18,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:14:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:18,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14717143] [2025-03-13 22:14:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14717143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:18,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729137486] [2025-03-13 22:14:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:18,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:18,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:18,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:19,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 263 [2025-03-13 22:14:19,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 286 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:19,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:19,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 263 [2025-03-13 22:14:19,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:19,830 INFO L124 PetriNetUnfolderBase]: 506/4440 cut-off events. [2025-03-13 22:14:19,830 INFO L125 PetriNetUnfolderBase]: For 587/729 co-relation queries the response was YES. [2025-03-13 22:14:19,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 4440 events. 506/4440 cut-off events. For 587/729 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 37507 event pairs, 64 based on Foata normal form. 60/4126 useless extension candidates. Maximal degree in co-relation 6500. Up to 613 conditions per place. [2025-03-13 22:14:19,850 INFO L140 encePairwiseOnDemand]: 239/263 looper letters, 80 selfloop transitions, 41 changer transitions 0/332 dead transitions. [2025-03-13 22:14:19,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 332 transitions, 1160 flow [2025-03-13 22:14:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-03-13 22:14:19,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8593155893536122 [2025-03-13 22:14:19,854 INFO L175 Difference]: Start difference. First operand has 253 places, 286 transitions, 790 flow. Second operand 6 states and 1356 transitions. [2025-03-13 22:14:19,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 332 transitions, 1160 flow [2025-03-13 22:14:19,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 332 transitions, 1160 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:19,866 INFO L231 Difference]: Finished difference. Result has 263 places, 326 transitions, 1132 flow [2025-03-13 22:14:19,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1132, PETRI_PLACES=263, PETRI_TRANSITIONS=326} [2025-03-13 22:14:19,867 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2025-03-13 22:14:19,867 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 326 transitions, 1132 flow [2025-03-13 22:14:19,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:19,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:19,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:19,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:14:19,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr6ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:19,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash -618509025, now seen corresponding path program 1 times [2025-03-13 22:14:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:19,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125584996] [2025-03-13 22:14:19,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:19,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:14:19,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:14:19,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:19,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:14:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:20,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125584996] [2025-03-13 22:14:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125584996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:20,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:20,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381266577] [2025-03-13 22:14:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:20,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:20,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:20,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:20,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:20,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 263 [2025-03-13 22:14:20,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 326 transitions, 1132 flow. Second operand has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:20,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:20,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 263 [2025-03-13 22:14:20,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:21,149 INFO L124 PetriNetUnfolderBase]: 752/5256 cut-off events. [2025-03-13 22:14:21,150 INFO L125 PetriNetUnfolderBase]: For 2542/2941 co-relation queries the response was YES. [2025-03-13 22:14:21,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9544 conditions, 5256 events. 752/5256 cut-off events. For 2542/2941 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 45521 event pairs, 80 based on Foata normal form. 106/4984 useless extension candidates. Maximal degree in co-relation 9479. Up to 1011 conditions per place. [2025-03-13 22:14:21,177 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 95 selfloop transitions, 86 changer transitions 0/408 dead transitions. [2025-03-13 22:14:21,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 408 transitions, 1966 flow [2025-03-13 22:14:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-13 22:14:21,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8738910012674271 [2025-03-13 22:14:21,180 INFO L175 Difference]: Start difference. First operand has 263 places, 326 transitions, 1132 flow. Second operand 6 states and 1379 transitions. [2025-03-13 22:14:21,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 408 transitions, 1966 flow [2025-03-13 22:14:21,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 408 transitions, 1966 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:21,193 INFO L231 Difference]: Finished difference. Result has 273 places, 408 transitions, 2008 flow [2025-03-13 22:14:21,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2008, PETRI_PLACES=273, PETRI_TRANSITIONS=408} [2025-03-13 22:14:21,193 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 24 predicate places. [2025-03-13 22:14:21,194 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 408 transitions, 2008 flow [2025-03-13 22:14:21,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:21,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:21,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:21,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:14:21,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:21,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1969085332, now seen corresponding path program 1 times [2025-03-13 22:14:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:21,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379216520] [2025-03-13 22:14:21,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:21,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:21,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 22:14:21,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 22:14:21,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:21,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:14:21,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:21,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379216520] [2025-03-13 22:14:21,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379216520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:21,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:21,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:21,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505663754] [2025-03-13 22:14:21,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:21,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:21,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:21,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:21,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:21,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 263 [2025-03-13 22:14:21,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 408 transitions, 2008 flow. Second operand has 6 states, 6 states have (on average 231.66666666666666) internal successors, (1390), 6 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:21,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:21,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 263 [2025-03-13 22:14:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:22,392 INFO L124 PetriNetUnfolderBase]: 811/5931 cut-off events. [2025-03-13 22:14:22,393 INFO L125 PetriNetUnfolderBase]: For 6401/7112 co-relation queries the response was YES. [2025-03-13 22:14:22,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11795 conditions, 5931 events. 811/5931 cut-off events. For 6401/7112 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54108 event pairs, 51 based on Foata normal form. 213/5762 useless extension candidates. Maximal degree in co-relation 11725. Up to 704 conditions per place. [2025-03-13 22:14:22,433 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 98 selfloop transitions, 62 changer transitions 0/469 dead transitions. [2025-03-13 22:14:22,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 469 transitions, 2684 flow [2025-03-13 22:14:22,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1426 transitions. [2025-03-13 22:14:22,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9036755386565273 [2025-03-13 22:14:22,436 INFO L175 Difference]: Start difference. First operand has 273 places, 408 transitions, 2008 flow. Second operand 6 states and 1426 transitions. [2025-03-13 22:14:22,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 469 transitions, 2684 flow [2025-03-13 22:14:22,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 469 transitions, 2684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:22,457 INFO L231 Difference]: Finished difference. Result has 283 places, 466 transitions, 2676 flow [2025-03-13 22:14:22,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2676, PETRI_PLACES=283, PETRI_TRANSITIONS=466} [2025-03-13 22:14:22,458 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 34 predicate places. [2025-03-13 22:14:22,458 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 466 transitions, 2676 flow [2025-03-13 22:14:22,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.66666666666666) internal successors, (1390), 6 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:22,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:22,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:22,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:14:22,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:22,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash -759013773, now seen corresponding path program 1 times [2025-03-13 22:14:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:22,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989885351] [2025-03-13 22:14:22,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:22,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-13 22:14:22,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-13 22:14:22,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:22,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:14:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:22,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989885351] [2025-03-13 22:14:22,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989885351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:22,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:22,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840866300] [2025-03-13 22:14:22,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:22,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:22,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:22,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:23,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 263 [2025-03-13 22:14:23,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 466 transitions, 2676 flow. Second operand has 6 states, 6 states have (on average 220.66666666666666) internal successors, (1324), 6 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:23,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:23,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 263 [2025-03-13 22:14:23,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:23,699 INFO L124 PetriNetUnfolderBase]: 1054/7178 cut-off events. [2025-03-13 22:14:23,699 INFO L125 PetriNetUnfolderBase]: For 10492/11185 co-relation queries the response was YES. [2025-03-13 22:14:23,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15798 conditions, 7178 events. 1054/7178 cut-off events. For 10492/11185 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 69488 event pairs, 80 based on Foata normal form. 132/6932 useless extension candidates. Maximal degree in co-relation 15723. Up to 1305 conditions per place. [2025-03-13 22:14:23,732 INFO L140 encePairwiseOnDemand]: 242/263 looper letters, 215 selfloop transitions, 70 changer transitions 0/531 dead transitions. [2025-03-13 22:14:23,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 531 transitions, 3684 flow [2025-03-13 22:14:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1392 transitions. [2025-03-13 22:14:23,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8821292775665399 [2025-03-13 22:14:23,736 INFO L175 Difference]: Start difference. First operand has 283 places, 466 transitions, 2676 flow. Second operand 6 states and 1392 transitions. [2025-03-13 22:14:23,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 531 transitions, 3684 flow [2025-03-13 22:14:23,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 531 transitions, 3684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:23,759 INFO L231 Difference]: Finished difference. Result has 293 places, 528 transitions, 3450 flow [2025-03-13 22:14:23,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2676, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3450, PETRI_PLACES=293, PETRI_TRANSITIONS=528} [2025-03-13 22:14:23,762 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 44 predicate places. [2025-03-13 22:14:23,762 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 528 transitions, 3450 flow [2025-03-13 22:14:23,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.66666666666666) internal successors, (1324), 6 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:23,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:23,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:14:23,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash 972241793, now seen corresponding path program 1 times [2025-03-13 22:14:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052871849] [2025-03-13 22:14:23,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:23,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-13 22:14:23,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 22:14:23,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:23,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:14:24,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:24,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052871849] [2025-03-13 22:14:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052871849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:24,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:24,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843248924] [2025-03-13 22:14:24,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:24,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:24,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:24,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:24,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 263 [2025-03-13 22:14:24,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 528 transitions, 3450 flow. Second operand has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:24,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:24,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 263 [2025-03-13 22:14:24,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:26,145 INFO L124 PetriNetUnfolderBase]: 4604/15132 cut-off events. [2025-03-13 22:14:26,145 INFO L125 PetriNetUnfolderBase]: For 17830/17968 co-relation queries the response was YES. [2025-03-13 22:14:26,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40812 conditions, 15132 events. 4604/15132 cut-off events. For 17830/17968 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 138671 event pairs, 2055 based on Foata normal form. 40/14408 useless extension candidates. Maximal degree in co-relation 40732. Up to 8616 conditions per place. [2025-03-13 22:14:26,215 INFO L140 encePairwiseOnDemand]: 224/263 looper letters, 301 selfloop transitions, 208 changer transitions 0/693 dead transitions. [2025-03-13 22:14:26,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 693 transitions, 5294 flow [2025-03-13 22:14:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1294 transitions. [2025-03-13 22:14:26,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200253485424588 [2025-03-13 22:14:26,219 INFO L175 Difference]: Start difference. First operand has 293 places, 528 transitions, 3450 flow. Second operand 6 states and 1294 transitions. [2025-03-13 22:14:26,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 693 transitions, 5294 flow [2025-03-13 22:14:26,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 693 transitions, 5122 flow, removed 86 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:26,281 INFO L231 Difference]: Finished difference. Result has 303 places, 693 transitions, 5070 flow [2025-03-13 22:14:26,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=3290, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5070, PETRI_PLACES=303, PETRI_TRANSITIONS=693} [2025-03-13 22:14:26,283 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 54 predicate places. [2025-03-13 22:14:26,283 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 693 transitions, 5070 flow [2025-03-13 22:14:26,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:26,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:26,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:26,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:14:26,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:26,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:26,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1764092554, now seen corresponding path program 1 times [2025-03-13 22:14:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:26,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956249790] [2025-03-13 22:14:26,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:26,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:26,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-13 22:14:26,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-13 22:14:26,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:26,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:14:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956249790] [2025-03-13 22:14:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956249790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:26,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:26,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042837778] [2025-03-13 22:14:26,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:26,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:26,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:26,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:27,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 263 [2025-03-13 22:14:27,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 693 transitions, 5070 flow. Second operand has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:27,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:27,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 263 [2025-03-13 22:14:27,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:28,266 INFO L124 PetriNetUnfolderBase]: 1706/9057 cut-off events. [2025-03-13 22:14:28,266 INFO L125 PetriNetUnfolderBase]: For 22025/23298 co-relation queries the response was YES. [2025-03-13 22:14:28,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24191 conditions, 9057 events. 1706/9057 cut-off events. For 22025/23298 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 88115 event pairs, 109 based on Foata normal form. 230/8893 useless extension candidates. Maximal degree in co-relation 24106. Up to 1674 conditions per place. [2025-03-13 22:14:28,329 INFO L140 encePairwiseOnDemand]: 248/263 looper letters, 311 selfloop transitions, 92 changer transitions 0/780 dead transitions. [2025-03-13 22:14:28,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 780 transitions, 6714 flow [2025-03-13 22:14:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-13 22:14:28,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8922686945500634 [2025-03-13 22:14:28,332 INFO L175 Difference]: Start difference. First operand has 303 places, 693 transitions, 5070 flow. Second operand 6 states and 1408 transitions. [2025-03-13 22:14:28,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 780 transitions, 6714 flow [2025-03-13 22:14:28,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 780 transitions, 6526 flow, removed 94 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:28,409 INFO L231 Difference]: Finished difference. Result has 313 places, 780 transitions, 6150 flow [2025-03-13 22:14:28,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=4882, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6150, PETRI_PLACES=313, PETRI_TRANSITIONS=780} [2025-03-13 22:14:28,410 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 64 predicate places. [2025-03-13 22:14:28,410 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 780 transitions, 6150 flow [2025-03-13 22:14:28,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:28,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:28,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:28,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:14:28,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:28,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1109589664, now seen corresponding path program 1 times [2025-03-13 22:14:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:28,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190846230] [2025-03-13 22:14:28,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:28,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-13 22:14:28,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:14:28,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:28,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:14:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:30,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190846230] [2025-03-13 22:14:30,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190846230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:30,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:30,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-13 22:14:30,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087155757] [2025-03-13 22:14:30,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:30,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-13 22:14:30,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:30,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-13 22:14:30,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-03-13 22:14:36,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 263 [2025-03-13 22:14:36,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 780 transitions, 6150 flow. Second operand has 26 states, 26 states have (on average 170.8846153846154) internal successors, (4443), 26 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:36,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:36,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 263 [2025-03-13 22:14:36,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:45,619 INFO L124 PetriNetUnfolderBase]: 9859/35960 cut-off events. [2025-03-13 22:14:45,619 INFO L125 PetriNetUnfolderBase]: For 76926/78343 co-relation queries the response was YES. [2025-03-13 22:14:45,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111240 conditions, 35960 events. 9859/35960 cut-off events. For 76926/78343 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 390667 event pairs, 1232 based on Foata normal form. 413/35111 useless extension candidates. Maximal degree in co-relation 111141. Up to 7504 conditions per place. [2025-03-13 22:14:46,048 INFO L140 encePairwiseOnDemand]: 217/263 looper letters, 1904 selfloop transitions, 317 changer transitions 14/2528 dead transitions. [2025-03-13 22:14:46,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 2528 transitions, 25524 flow [2025-03-13 22:14:46,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-13 22:14:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-03-13 22:14:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 10182 transitions. [2025-03-13 22:14:46,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6913362303096143 [2025-03-13 22:14:46,061 INFO L175 Difference]: Start difference. First operand has 313 places, 780 transitions, 6150 flow. Second operand 56 states and 10182 transitions. [2025-03-13 22:14:46,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 2528 transitions, 25524 flow [2025-03-13 22:14:46,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 2528 transitions, 24884 flow, removed 320 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:46,407 INFO L231 Difference]: Finished difference. Result has 408 places, 1157 transitions, 10066 flow [2025-03-13 22:14:46,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=5974, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=10066, PETRI_PLACES=408, PETRI_TRANSITIONS=1157} [2025-03-13 22:14:46,408 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 159 predicate places. [2025-03-13 22:14:46,409 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 1157 transitions, 10066 flow [2025-03-13 22:14:46,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 170.8846153846154) internal successors, (4443), 26 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:46,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:46,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:14:46,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:14:46,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:14:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1971524706, now seen corresponding path program 2 times [2025-03-13 22:14:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:46,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853730589] [2025-03-13 22:14:46,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:14:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:46,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 22:14:46,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:14:46,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:14:46,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:14:47,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:47,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853730589] [2025-03-13 22:14:47,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853730589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:47,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:47,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-13 22:14:47,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452229175] [2025-03-13 22:14:47,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:47,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 22:14:47,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:47,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 22:14:47,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-13 22:14:54,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 263 [2025-03-13 22:14:54,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 1157 transitions, 10066 flow. Second operand has 24 states, 24 states have (on average 179.79166666666666) internal successors, (4315), 24 states have internal predecessors, (4315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:14:54,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:54,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 263 [2025-03-13 22:14:54,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:05,809 INFO L124 PetriNetUnfolderBase]: 11567/45941 cut-off events. [2025-03-13 22:15:05,810 INFO L125 PetriNetUnfolderBase]: For 200988/204716 co-relation queries the response was YES. [2025-03-13 22:15:06,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160867 conditions, 45941 events. 11567/45941 cut-off events. For 200988/204716 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 537255 event pairs, 1035 based on Foata normal form. 813/45536 useless extension candidates. Maximal degree in co-relation 160720. Up to 12382 conditions per place. [2025-03-13 22:15:06,571 INFO L140 encePairwiseOnDemand]: 211/263 looper letters, 1340 selfloop transitions, 387 changer transitions 8/2154 dead transitions. [2025-03-13 22:15:06,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 2154 transitions, 22015 flow [2025-03-13 22:15:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-13 22:15:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-13 22:15:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6774 transitions. [2025-03-13 22:15:06,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7359043997827268 [2025-03-13 22:15:06,577 INFO L175 Difference]: Start difference. First operand has 408 places, 1157 transitions, 10066 flow. Second operand 35 states and 6774 transitions. [2025-03-13 22:15:06,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 2154 transitions, 22015 flow [2025-03-13 22:15:08,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 2154 transitions, 21980 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-13 22:15:08,098 INFO L231 Difference]: Finished difference. Result has 464 places, 1488 transitions, 15291 flow [2025-03-13 22:15:08,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=10035, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=15291, PETRI_PLACES=464, PETRI_TRANSITIONS=1488} [2025-03-13 22:15:08,099 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 215 predicate places. [2025-03-13 22:15:08,099 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 1488 transitions, 15291 flow [2025-03-13 22:15:08,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 179.79166666666666) internal successors, (4315), 24 states have internal predecessors, (4315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:08,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:08,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:08,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:15:08,101 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 22:15:08,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:08,102 INFO L85 PathProgramCache]: Analyzing trace with hash 64492048, now seen corresponding path program 3 times [2025-03-13 22:15:08,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:08,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023153991] [2025-03-13 22:15:08,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:15:08,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:08,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 2 equivalence classes. [2025-03-13 22:15:08,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:15:08,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 22:15:08,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:15:11,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:11,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023153991] [2025-03-13 22:15:11,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023153991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:11,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:11,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-13 22:15:11,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103372154] [2025-03-13 22:15:11,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:11,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-13 22:15:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:11,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-13 22:15:11,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2025-03-13 22:15:21,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 263 [2025-03-13 22:15:21,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 1488 transitions, 15291 flow. Second operand has 33 states, 33 states have (on average 127.78787878787878) internal successors, (4217), 33 states have internal predecessors, (4217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:21,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:21,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 263 [2025-03-13 22:15:21,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand