./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:19:18,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:19:18,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:19:18,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:19:18,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:19:18,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:19:18,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:19:18,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:19:18,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:19:18,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:19:18,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:19:18,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:19:18,950 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:19:18,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:19:18,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:19:18,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:19:18,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:19:18,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:19:18,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:19:18,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:19:18,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:19:18,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:19:18,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:19:18,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:19:18,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:19:18,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:19:18,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:19:18,952 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b [2025-02-06 09:19:19,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:19:19,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:19:19,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:19:19,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:19:19,134 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:19:19,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-02-06 09:19:20,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c4cd10bd/9fa53fa4c4134e16bc8060ba90792d30/FLAG7815b846e [2025-02-06 09:19:20,603 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:19:20,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-02-06 09:19:20,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c4cd10bd/9fa53fa4c4134e16bc8060ba90792d30/FLAG7815b846e [2025-02-06 09:19:20,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c4cd10bd/9fa53fa4c4134e16bc8060ba90792d30 [2025-02-06 09:19:20,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:19:20,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:19:20,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:19:20,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:19:20,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:19:20,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:20,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425bce44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20, skipping insertion in model container [2025-02-06 09:19:20,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:20,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:19:20,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:19:20,931 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:19:20,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:19:20,999 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:19:20,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20 WrapperNode [2025-02-06 09:19:20,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:19:21,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:19:21,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:19:21,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:19:21,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,043 INFO L138 Inliner]: procedures = 223, calls = 39, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 215 [2025-02-06 09:19:21,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:19:21,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:19:21,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:19:21,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:19:21,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:19:21,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:19:21,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:19:21,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:19:21,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (1/1) ... [2025-02-06 09:19:21,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:19:21,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:19:21,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:19:21,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:19:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2025-02-06 09:19:21,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2025-02-06 09:19:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:19:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:19:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:19:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:19:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:19:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:19:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:19:21,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:19:21,151 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:19:21,244 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:19:21,245 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:19:21,463 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc ring_empty_#t~mem15#1; [2025-02-06 09:19:21,464 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-1: havoc ring_empty_#t~mem14#1; [2025-02-06 09:19:21,464 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-18: havoc ring_empty_#t~mem15#1; [2025-02-06 09:19:21,464 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-19: havoc ring_empty_#t~mem14#1; [2025-02-06 09:19:21,634 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:19:21,634 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:19:21,648 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:19:21,649 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:19:21,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:19:21 BoogieIcfgContainer [2025-02-06 09:19:21,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:19:21,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:19:21,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:19:21,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:19:21,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:19:20" (1/3) ... [2025-02-06 09:19:21,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f01434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:19:21, skipping insertion in model container [2025-02-06 09:19:21,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:20" (2/3) ... [2025-02-06 09:19:21,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f01434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:19:21, skipping insertion in model container [2025-02-06 09:19:21,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:19:21" (3/3) ... [2025-02-06 09:19:21,657 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2025-02-06 09:19:21,667 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:19:21,669 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ring_1w1r-2.i that has 2 procedures, 254 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-02-06 09:19:21,669 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:19:21,748 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:19:21,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 264 transitions, 535 flow [2025-02-06 09:19:21,897 INFO L124 PetriNetUnfolderBase]: 11/263 cut-off events. [2025-02-06 09:19:21,898 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:19:21,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 263 events. 11/263 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 559 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2025-02-06 09:19:21,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 264 transitions, 535 flow [2025-02-06 09:19:21,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 250 places, 257 transitions, 517 flow [2025-02-06 09:19:21,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:19:21,938 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;@61f9de97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:19:21,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-06 09:19:21,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:19:21,949 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-02-06 09:19:21,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:19:21,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:21,949 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-02-06 09:19:21,949 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-02-06 09:19:21,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -215378311, now seen corresponding path program 1 times [2025-02-06 09:19:21,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887177591] [2025-02-06 09:19:21,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:22,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 09:19:22,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 09:19:22,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:22,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887177591] [2025-02-06 09:19:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887177591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:22,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:22,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635270563] [2025-02-06 09:19:22,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:22,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:22,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:22,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:23,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 264 [2025-02-06 09:19:23,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 257 transitions, 517 flow. Second operand has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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-02-06 09:19:23,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:23,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 264 [2025-02-06 09:19:23,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:23,481 INFO L124 PetriNetUnfolderBase]: 908/4257 cut-off events. [2025-02-06 09:19:23,482 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:19:23,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5979 conditions, 4257 events. 908/4257 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33864 event pairs, 768 based on Foata normal form. 262/4113 useless extension candidates. Maximal degree in co-relation 5920. Up to 1713 conditions per place. [2025-02-06 09:19:23,497 INFO L140 encePairwiseOnDemand]: 251/264 looper letters, 62 selfloop transitions, 5 changer transitions 0/246 dead transitions. [2025-02-06 09:19:23,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 246 transitions, 629 flow [2025-02-06 09:19:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1203 transitions. [2025-02-06 09:19:23,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.759469696969697 [2025-02-06 09:19:23,510 INFO L175 Difference]: Start difference. First operand has 250 places, 257 transitions, 517 flow. Second operand 6 states and 1203 transitions. [2025-02-06 09:19:23,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 246 transitions, 629 flow [2025-02-06 09:19:23,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 246 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:19:23,517 INFO L231 Difference]: Finished difference. Result has 250 places, 246 transitions, 504 flow [2025-02-06 09:19:23,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=250, PETRI_TRANSITIONS=246} [2025-02-06 09:19:23,521 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 0 predicate places. [2025-02-06 09:19:23,521 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 246 transitions, 504 flow [2025-02-06 09:19:23,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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-02-06 09:19:23,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:23,522 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-02-06 09:19:23,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:19:23,523 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-02-06 09:19:23,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:23,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1579561386, now seen corresponding path program 1 times [2025-02-06 09:19:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:23,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910110931] [2025-02-06 09:19:23,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:23,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:19:23,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:19:23,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:23,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:23,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:23,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910110931] [2025-02-06 09:19:23,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910110931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:23,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:23,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:23,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071550214] [2025-02-06 09:19:23,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:23,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:23,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:23,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:23,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:24,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 264 [2025-02-06 09:19:24,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 246 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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-02-06 09:19:24,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:24,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 264 [2025-02-06 09:19:24,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:24,481 INFO L124 PetriNetUnfolderBase]: 908/4256 cut-off events. [2025-02-06 09:19:24,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:19:24,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 4256 events. 908/4256 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33895 event pairs, 768 based on Foata normal form. 0/3851 useless extension candidates. Maximal degree in co-relation 5932. Up to 1713 conditions per place. [2025-02-06 09:19:24,494 INFO L140 encePairwiseOnDemand]: 258/264 looper letters, 62 selfloop transitions, 5 changer transitions 0/245 dead transitions. [2025-02-06 09:19:24,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 245 transitions, 636 flow [2025-02-06 09:19:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1196 transitions. [2025-02-06 09:19:24,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7550505050505051 [2025-02-06 09:19:24,499 INFO L175 Difference]: Start difference. First operand has 250 places, 246 transitions, 504 flow. Second operand 6 states and 1196 transitions. [2025-02-06 09:19:24,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 245 transitions, 636 flow [2025-02-06 09:19:24,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 245 transitions, 626 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:19:24,506 INFO L231 Difference]: Finished difference. Result has 249 places, 245 transitions, 502 flow [2025-02-06 09:19:24,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, 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-02-06 09:19:24,509 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, -1 predicate places. [2025-02-06 09:19:24,509 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 245 transitions, 502 flow [2025-02-06 09:19:24,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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-02-06 09:19:24,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:24,510 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-02-06 09:19:24,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:19:24,510 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-02-06 09:19:24,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash -384944645, now seen corresponding path program 1 times [2025-02-06 09:19:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:24,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180040250] [2025-02-06 09:19:24,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:24,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:19:24,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:19:24,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:24,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180040250] [2025-02-06 09:19:24,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180040250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:24,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223405838] [2025-02-06 09:19:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:24,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:24,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:24,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:25,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 264 [2025-02-06 09:19:25,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 245 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 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-02-06 09:19:25,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:25,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 264 [2025-02-06 09:19:25,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:25,498 INFO L124 PetriNetUnfolderBase]: 323/2441 cut-off events. [2025-02-06 09:19:25,499 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:19:25,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3043 conditions, 2441 events. 323/2441 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 18261 event pairs, 94 based on Foata normal form. 0/2171 useless extension candidates. Maximal degree in co-relation 2991. Up to 487 conditions per place. [2025-02-06 09:19:25,511 INFO L140 encePairwiseOnDemand]: 242/264 looper letters, 37 selfloop transitions, 44 changer transitions 0/287 dead transitions. [2025-02-06 09:19:25,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 287 transitions, 748 flow [2025-02-06 09:19:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1385 transitions. [2025-02-06 09:19:25,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743686868686869 [2025-02-06 09:19:25,514 INFO L175 Difference]: Start difference. First operand has 249 places, 245 transitions, 502 flow. Second operand 6 states and 1385 transitions. [2025-02-06 09:19:25,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 287 transitions, 748 flow [2025-02-06 09:19:25,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 287 transitions, 738 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:19:25,521 INFO L231 Difference]: Finished difference. Result has 254 places, 287 transitions, 792 flow [2025-02-06 09:19:25,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=792, PETRI_PLACES=254, PETRI_TRANSITIONS=287} [2025-02-06 09:19:25,522 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 4 predicate places. [2025-02-06 09:19:25,522 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 287 transitions, 792 flow [2025-02-06 09:19:25,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 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-02-06 09:19:25,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:25,523 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] [2025-02-06 09:19:25,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:19:25,523 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-02-06 09:19:25,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash 77993213, now seen corresponding path program 1 times [2025-02-06 09:19:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394691309] [2025-02-06 09:19:25,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:25,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:25,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:19:25,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:19:25,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:25,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:19:25,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:25,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394691309] [2025-02-06 09:19:25,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394691309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:25,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:25,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270733463] [2025-02-06 09:19:25,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:25,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:25,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:25,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:25,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:26,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 264 [2025-02-06 09:19:26,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 287 transitions, 792 flow. Second operand has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 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-02-06 09:19:26,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:26,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 264 [2025-02-06 09:19:26,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:26,743 INFO L124 PetriNetUnfolderBase]: 478/4443 cut-off events. [2025-02-06 09:19:26,743 INFO L125 PetriNetUnfolderBase]: For 600/718 co-relation queries the response was YES. [2025-02-06 09:19:26,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6535 conditions, 4443 events. 478/4443 cut-off events. For 600/718 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 38050 event pairs, 73 based on Foata normal form. 52/4119 useless extension candidates. Maximal degree in co-relation 6475. Up to 613 conditions per place. [2025-02-06 09:19:26,762 INFO L140 encePairwiseOnDemand]: 240/264 looper letters, 80 selfloop transitions, 41 changer transitions 0/333 dead transitions. [2025-02-06 09:19:26,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 333 transitions, 1162 flow [2025-02-06 09:19:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1362 transitions. [2025-02-06 09:19:26,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8598484848484849 [2025-02-06 09:19:26,765 INFO L175 Difference]: Start difference. First operand has 254 places, 287 transitions, 792 flow. Second operand 6 states and 1362 transitions. [2025-02-06 09:19:26,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 333 transitions, 1162 flow [2025-02-06 09:19:26,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 333 transitions, 1162 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:19:26,777 INFO L231 Difference]: Finished difference. Result has 264 places, 327 transitions, 1134 flow [2025-02-06 09:19:26,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1134, PETRI_PLACES=264, PETRI_TRANSITIONS=327} [2025-02-06 09:19:26,778 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 14 predicate places. [2025-02-06 09:19:26,778 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 327 transitions, 1134 flow [2025-02-06 09:19:26,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 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-02-06 09:19:26,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:26,779 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-02-06 09:19:26,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:19:26,780 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-02-06 09:19:26,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1524107358, now seen corresponding path program 1 times [2025-02-06 09:19:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:26,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882939102] [2025-02-06 09:19:26,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:26,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:26,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:19:26,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:19:26,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:26,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:19:27,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:27,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882939102] [2025-02-06 09:19:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882939102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:27,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943867192] [2025-02-06 09:19:27,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:27,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:27,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:27,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:27,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 264 [2025-02-06 09:19:27,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 327 transitions, 1134 flow. Second operand has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 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-02-06 09:19:27,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:27,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 264 [2025-02-06 09:19:27,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:27,929 INFO L124 PetriNetUnfolderBase]: 747/5302 cut-off events. [2025-02-06 09:19:27,930 INFO L125 PetriNetUnfolderBase]: For 2504/3031 co-relation queries the response was YES. [2025-02-06 09:19:27,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9577 conditions, 5302 events. 747/5302 cut-off events. For 2504/3031 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 46377 event pairs, 94 based on Foata normal form. 82/5006 useless extension candidates. Maximal degree in co-relation 9512. Up to 1011 conditions per place. [2025-02-06 09:19:27,968 INFO L140 encePairwiseOnDemand]: 242/264 looper letters, 95 selfloop transitions, 86 changer transitions 0/409 dead transitions. [2025-02-06 09:19:27,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 409 transitions, 1968 flow [2025-02-06 09:19:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1385 transitions. [2025-02-06 09:19:27,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743686868686869 [2025-02-06 09:19:27,972 INFO L175 Difference]: Start difference. First operand has 264 places, 327 transitions, 1134 flow. Second operand 6 states and 1385 transitions. [2025-02-06 09:19:27,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 409 transitions, 1968 flow [2025-02-06 09:19:28,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 409 transitions, 1968 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:19:28,058 INFO L231 Difference]: Finished difference. Result has 274 places, 409 transitions, 2010 flow [2025-02-06 09:19:28,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2010, PETRI_PLACES=274, PETRI_TRANSITIONS=409} [2025-02-06 09:19:28,059 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 24 predicate places. [2025-02-06 09:19:28,060 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 409 transitions, 2010 flow [2025-02-06 09:19:28,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 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-02-06 09:19:28,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:28,061 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] [2025-02-06 09:19:28,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:19:28,061 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-02-06 09:19:28,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:28,062 INFO L85 PathProgramCache]: Analyzing trace with hash 961878443, now seen corresponding path program 1 times [2025-02-06 09:19:28,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:28,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015109296] [2025-02-06 09:19:28,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:28,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:28,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 09:19:28,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 09:19:28,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:28,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:19:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015109296] [2025-02-06 09:19:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015109296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:28,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:28,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226374918] [2025-02-06 09:19:28,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:28,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:28,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:28,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:28,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:28,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 264 [2025-02-06 09:19:28,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 409 transitions, 2010 flow. Second operand has 6 states, 6 states have (on average 232.66666666666666) internal successors, (1396), 6 states have internal predecessors, (1396), 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-02-06 09:19:28,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:28,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 264 [2025-02-06 09:19:28,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:29,339 INFO L124 PetriNetUnfolderBase]: 837/6032 cut-off events. [2025-02-06 09:19:29,339 INFO L125 PetriNetUnfolderBase]: For 6754/7691 co-relation queries the response was YES. [2025-02-06 09:19:29,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11945 conditions, 6032 events. 837/6032 cut-off events. For 6754/7691 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54960 event pairs, 48 based on Foata normal form. 201/5849 useless extension candidates. Maximal degree in co-relation 11875. Up to 704 conditions per place. [2025-02-06 09:19:29,366 INFO L140 encePairwiseOnDemand]: 253/264 looper letters, 98 selfloop transitions, 62 changer transitions 0/470 dead transitions. [2025-02-06 09:19:29,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 470 transitions, 2686 flow [2025-02-06 09:19:29,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1432 transitions. [2025-02-06 09:19:29,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9040404040404041 [2025-02-06 09:19:29,369 INFO L175 Difference]: Start difference. First operand has 274 places, 409 transitions, 2010 flow. Second operand 6 states and 1432 transitions. [2025-02-06 09:19:29,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 470 transitions, 2686 flow [2025-02-06 09:19:29,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 470 transitions, 2686 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:19:29,384 INFO L231 Difference]: Finished difference. Result has 284 places, 467 transitions, 2678 flow [2025-02-06 09:19:29,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2678, PETRI_PLACES=284, PETRI_TRANSITIONS=467} [2025-02-06 09:19:29,385 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 34 predicate places. [2025-02-06 09:19:29,385 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 467 transitions, 2678 flow [2025-02-06 09:19:29,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.66666666666666) internal successors, (1396), 6 states have internal predecessors, (1396), 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-02-06 09:19:29,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:29,385 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-02-06 09:19:29,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:19:29,386 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-02-06 09:19:29,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash 840126582, now seen corresponding path program 1 times [2025-02-06 09:19:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:29,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89113256] [2025-02-06 09:19:29,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:29,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 09:19:29,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 09:19:29,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:29,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:29,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-02-06 09:19:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89113256] [2025-02-06 09:19:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89113256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:29,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991909363] [2025-02-06 09:19:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:29,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:29,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:29,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:30,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 264 [2025-02-06 09:19:30,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 467 transitions, 2678 flow. Second operand has 6 states, 6 states have (on average 221.66666666666666) internal successors, (1330), 6 states have internal predecessors, (1330), 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-02-06 09:19:30,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:30,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 264 [2025-02-06 09:19:30,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:30,795 INFO L124 PetriNetUnfolderBase]: 1146/7372 cut-off events. [2025-02-06 09:19:30,795 INFO L125 PetriNetUnfolderBase]: For 10388/11299 co-relation queries the response was YES. [2025-02-06 09:19:30,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16110 conditions, 7372 events. 1146/7372 cut-off events. For 10388/11299 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 70931 event pairs, 80 based on Foata normal form. 159/7153 useless extension candidates. Maximal degree in co-relation 16035. Up to 1306 conditions per place. [2025-02-06 09:19:30,828 INFO L140 encePairwiseOnDemand]: 243/264 looper letters, 215 selfloop transitions, 70 changer transitions 0/532 dead transitions. [2025-02-06 09:19:30,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 532 transitions, 3686 flow [2025-02-06 09:19:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2025-02-06 09:19:30,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8825757575757576 [2025-02-06 09:19:30,831 INFO L175 Difference]: Start difference. First operand has 284 places, 467 transitions, 2678 flow. Second operand 6 states and 1398 transitions. [2025-02-06 09:19:30,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 532 transitions, 3686 flow [2025-02-06 09:19:30,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 532 transitions, 3686 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:19:30,851 INFO L231 Difference]: Finished difference. Result has 294 places, 529 transitions, 3452 flow [2025-02-06 09:19:30,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=2678, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3452, PETRI_PLACES=294, PETRI_TRANSITIONS=529} [2025-02-06 09:19:30,854 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 44 predicate places. [2025-02-06 09:19:30,854 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 529 transitions, 3452 flow [2025-02-06 09:19:30,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 221.66666666666666) internal successors, (1330), 6 states have internal predecessors, (1330), 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-02-06 09:19:30,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:30,855 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] [2025-02-06 09:19:30,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:19:30,855 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-02-06 09:19:30,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:30,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1704682025, now seen corresponding path program 1 times [2025-02-06 09:19:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:30,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258024265] [2025-02-06 09:19:30,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:30,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:30,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:19:30,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:19:30,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:30,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:19:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258024265] [2025-02-06 09:19:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258024265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:31,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:31,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932296384] [2025-02-06 09:19:31,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:31,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:31,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:31,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:31,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 264 [2025-02-06 09:19:31,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 529 transitions, 3452 flow. Second operand has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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-02-06 09:19:31,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:31,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 264 [2025-02-06 09:19:31,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:33,321 INFO L124 PetriNetUnfolderBase]: 4592/15189 cut-off events. [2025-02-06 09:19:33,322 INFO L125 PetriNetUnfolderBase]: For 17822/17960 co-relation queries the response was YES. [2025-02-06 09:19:33,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40816 conditions, 15189 events. 4592/15189 cut-off events. For 17822/17960 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 139632 event pairs, 2055 based on Foata normal form. 40/14472 useless extension candidates. Maximal degree in co-relation 40736. Up to 8605 conditions per place. [2025-02-06 09:19:33,384 INFO L140 encePairwiseOnDemand]: 225/264 looper letters, 301 selfloop transitions, 208 changer transitions 0/694 dead transitions. [2025-02-06 09:19:33,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 694 transitions, 5296 flow [2025-02-06 09:19:33,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1300 transitions. [2025-02-06 09:19:33,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8207070707070707 [2025-02-06 09:19:33,388 INFO L175 Difference]: Start difference. First operand has 294 places, 529 transitions, 3452 flow. Second operand 6 states and 1300 transitions. [2025-02-06 09:19:33,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 694 transitions, 5296 flow [2025-02-06 09:19:33,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 694 transitions, 5124 flow, removed 86 selfloop flow, removed 0 redundant places. [2025-02-06 09:19:33,444 INFO L231 Difference]: Finished difference. Result has 304 places, 694 transitions, 5072 flow [2025-02-06 09:19:33,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=3292, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5072, PETRI_PLACES=304, PETRI_TRANSITIONS=694} [2025-02-06 09:19:33,445 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 54 predicate places. [2025-02-06 09:19:33,445 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 694 transitions, 5072 flow [2025-02-06 09:19:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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-02-06 09:19:33,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:33,445 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-02-06 09:19:33,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:19:33,446 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-02-06 09:19:33,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2140730887, now seen corresponding path program 1 times [2025-02-06 09:19:33,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:33,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028099626] [2025-02-06 09:19:33,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:33,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:33,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 09:19:33,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 09:19:33,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:33,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:19:33,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:33,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028099626] [2025-02-06 09:19:33,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028099626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:33,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:33,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195867565] [2025-02-06 09:19:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:33,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:33,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:33,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:34,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 264 [2025-02-06 09:19:34,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 694 transitions, 5072 flow. Second operand has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 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-02-06 09:19:34,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:34,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 264 [2025-02-06 09:19:34,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:35,147 INFO L124 PetriNetUnfolderBase]: 1663/9111 cut-off events. [2025-02-06 09:19:35,147 INFO L125 PetriNetUnfolderBase]: For 23650/25524 co-relation queries the response was YES. [2025-02-06 09:19:35,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24204 conditions, 9111 events. 1663/9111 cut-off events. For 23650/25524 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 89441 event pairs, 108 based on Foata normal form. 230/8941 useless extension candidates. Maximal degree in co-relation 24119. Up to 1683 conditions per place. [2025-02-06 09:19:35,350 INFO L140 encePairwiseOnDemand]: 249/264 looper letters, 311 selfloop transitions, 92 changer transitions 0/781 dead transitions. [2025-02-06 09:19:35,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 781 transitions, 6716 flow [2025-02-06 09:19:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1414 transitions. [2025-02-06 09:19:35,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8926767676767676 [2025-02-06 09:19:35,353 INFO L175 Difference]: Start difference. First operand has 304 places, 694 transitions, 5072 flow. Second operand 6 states and 1414 transitions. [2025-02-06 09:19:35,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 781 transitions, 6716 flow [2025-02-06 09:19:35,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 781 transitions, 6528 flow, removed 94 selfloop flow, removed 0 redundant places. [2025-02-06 09:19:35,404 INFO L231 Difference]: Finished difference. Result has 314 places, 781 transitions, 6152 flow [2025-02-06 09:19:35,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=4884, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6152, PETRI_PLACES=314, PETRI_TRANSITIONS=781} [2025-02-06 09:19:35,405 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 64 predicate places. [2025-02-06 09:19:35,405 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 781 transitions, 6152 flow [2025-02-06 09:19:35,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 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-02-06 09:19:35,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:35,406 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, 1] [2025-02-06 09:19:35,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:19:35,407 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-02-06 09:19:35,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1063066162, now seen corresponding path program 1 times [2025-02-06 09:19:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:35,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057134355] [2025-02-06 09:19:35,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:35,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:35,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 09:19:35,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 09:19:35,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:35,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:19:37,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:37,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057134355] [2025-02-06 09:19:37,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057134355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:37,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:37,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-06 09:19:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780783583] [2025-02-06 09:19:37,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:37,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 09:19:37,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:37,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 09:19:37,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2025-02-06 09:19:45,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 264 [2025-02-06 09:19:45,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 781 transitions, 6152 flow. Second operand has 24 states, 24 states have (on average 180.79166666666666) internal successors, (4339), 24 states have internal predecessors, (4339), 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-02-06 09:19:45,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:45,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 264 [2025-02-06 09:19:45,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:52,218 INFO L124 PetriNetUnfolderBase]: 5652/24153 cut-off events. [2025-02-06 09:19:52,218 INFO L125 PetriNetUnfolderBase]: For 45922/47278 co-relation queries the response was YES. [2025-02-06 09:19:52,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68440 conditions, 24153 events. 5652/24153 cut-off events. For 45922/47278 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 268791 event pairs, 498 based on Foata normal form. 380/23612 useless extension candidates. Maximal degree in co-relation 68341. Up to 5336 conditions per place. [2025-02-06 09:19:52,392 INFO L140 encePairwiseOnDemand]: 212/264 looper letters, 978 selfloop transitions, 249 changer transitions 12/1577 dead transitions. [2025-02-06 09:19:52,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1577 transitions, 14496 flow [2025-02-06 09:19:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 09:19:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-02-06 09:19:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6555 transitions. [2025-02-06 09:19:52,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7302807486631016 [2025-02-06 09:19:52,406 INFO L175 Difference]: Start difference. First operand has 314 places, 781 transitions, 6152 flow. Second operand 34 states and 6555 transitions. [2025-02-06 09:19:52,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 1577 transitions, 14496 flow [2025-02-06 09:19:52,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 1577 transitions, 14176 flow, removed 160 selfloop flow, removed 0 redundant places. [2025-02-06 09:19:52,596 INFO L231 Difference]: Finished difference. Result has 374 places, 1020 transitions, 9101 flow [2025-02-06 09:19:52,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=5976, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=9101, PETRI_PLACES=374, PETRI_TRANSITIONS=1020} [2025-02-06 09:19:52,597 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 124 predicate places. [2025-02-06 09:19:52,597 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 1020 transitions, 9101 flow [2025-02-06 09:19:52,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 180.79166666666666) internal successors, (4339), 24 states have internal predecessors, (4339), 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-02-06 09:19:52,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:52,600 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, 1] [2025-02-06 09:19:52,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:19:52,600 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-02-06 09:19:52,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash -980486388, now seen corresponding path program 2 times [2025-02-06 09:19:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:52,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634676514] [2025-02-06 09:19:52,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:19:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:52,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-02-06 09:19:52,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 09:19:52,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:19:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:19:55,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:55,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634676514] [2025-02-06 09:19:55,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634676514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:55,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:55,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-02-06 09:19:55,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302428640] [2025-02-06 09:19:55,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:55,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 09:19:55,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:55,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 09:19:55,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 09:20:03,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 264 [2025-02-06 09:20:03,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1020 transitions, 9101 flow. Second operand has 33 states, 33 states have (on average 128.78787878787878) internal successors, (4250), 33 states have internal predecessors, (4250), 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-02-06 09:20:03,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:03,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 264 [2025-02-06 09:20:03,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:32,925 INFO L124 PetriNetUnfolderBase]: 35321/86836 cut-off events. [2025-02-06 09:20:32,925 INFO L125 PetriNetUnfolderBase]: For 253722/254233 co-relation queries the response was YES. [2025-02-06 09:20:33,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316343 conditions, 86836 events. 35321/86836 cut-off events. For 253722/254233 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 937961 event pairs, 12185 based on Foata normal form. 238/85488 useless extension candidates. Maximal degree in co-relation 316208. Up to 34569 conditions per place. [2025-02-06 09:20:34,397 INFO L140 encePairwiseOnDemand]: 202/264 looper letters, 3124 selfloop transitions, 470 changer transitions 40/3757 dead transitions. [2025-02-06 09:20:34,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 3757 transitions, 38063 flow [2025-02-06 09:20:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-02-06 09:20:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-02-06 09:20:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 8499 transitions. [2025-02-06 09:20:34,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853305785123967 [2025-02-06 09:20:34,404 INFO L175 Difference]: Start difference. First operand has 374 places, 1020 transitions, 9101 flow. Second operand 55 states and 8499 transitions. [2025-02-06 09:20:34,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 3757 transitions, 38063 flow [2025-02-06 09:20:35,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 3757 transitions, 38052 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:20:35,888 INFO L231 Difference]: Finished difference. Result has 468 places, 1537 transitions, 16929 flow [2025-02-06 09:20:35,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=9090, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=16929, PETRI_PLACES=468, PETRI_TRANSITIONS=1537} [2025-02-06 09:20:35,889 INFO L279 CegarLoopForPetriNet]: 250 programPoint places, 218 predicate places. [2025-02-06 09:20:35,889 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 1537 transitions, 16929 flow [2025-02-06 09:20:35,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 128.78787878787878) internal successors, (4250), 33 states have internal predecessors, (4250), 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-02-06 09:20:35,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:35,891 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, 1] [2025-02-06 09:20:35,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:20:35,891 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-02-06 09:20:35,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:35,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1067934552, now seen corresponding path program 3 times [2025-02-06 09:20:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939638077] [2025-02-06 09:20:35,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:20:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:35,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 2 equivalence classes. [2025-02-06 09:20:35,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 09:20:35,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 09:20:35,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:20:37,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:37,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939638077] [2025-02-06 09:20:37,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939638077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:37,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:37,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-02-06 09:20:37,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436975826] [2025-02-06 09:20:37,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:37,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 09:20:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:37,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 09:20:37,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-02-06 09:20:45,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 264 [2025-02-06 09:20:45,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 1537 transitions, 16929 flow. Second operand has 26 states, 26 states have (on average 171.8846153846154) internal successors, (4469), 26 states have internal predecessors, (4469), 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-02-06 09:20:45,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:45,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 264 [2025-02-06 09:20:45,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand