./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_13-equ_proc_nr.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/goblint-regression/06-symbeq_13-equ_proc_nr.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 7aa541197ab3d76d3553dcc8603f5c865e8a029202164eb406db53a61111f080 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:20:55,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:20:55,899 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:20:55,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:20:55,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:20:55,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:20:55,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:20:55,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:20:55,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:20:55,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:20:55,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:20:55,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:20:55,940 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:20:55,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:20:55,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:20:55,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:20:55,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:20:55,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:20:55,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:20:55,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:20:55,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:20:55,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:20:55,942 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:20:55,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:20:55,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:20:55,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:20:55,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:20:55,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:20:55,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:20:55,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:20:55,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:20:55,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:55,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:20:55,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:20:55,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:20:55,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:20:55,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:20:55,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:20:55,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:20:55,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:20:55,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:20:55,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:20:55,945 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 -> 7aa541197ab3d76d3553dcc8603f5c865e8a029202164eb406db53a61111f080 [2025-02-06 09:20:56,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:20:56,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:20:56,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:20:56,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:20:56,248 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:20:56,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_13-equ_proc_nr.i [2025-02-06 09:20:57,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6a4e12ed/058905e3b5914befb21ec7d34415d17f/FLAGb2528b49a [2025-02-06 09:20:58,017 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:20:58,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_13-equ_proc_nr.i [2025-02-06 09:20:58,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6a4e12ed/058905e3b5914befb21ec7d34415d17f/FLAGb2528b49a [2025-02-06 09:20:58,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6a4e12ed/058905e3b5914befb21ec7d34415d17f [2025-02-06 09:20:58,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:20:58,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:20:58,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:58,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:20:58,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:20:58,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e89eb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58, skipping insertion in model container [2025-02-06 09:20:58,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:20:58,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:58,461 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:20:58,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:58,565 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:20:58,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58 WrapperNode [2025-02-06 09:20:58,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:58,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:58,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:20:58,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:20:58,573 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:20:58" (1/1) ... [2025-02-06 09:20:58,583 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:20:58" (1/1) ... [2025-02-06 09:20:58,602 INFO L138 Inliner]: procedures = 266, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2025-02-06 09:20:58,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:58,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:20:58,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:20:58,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:20:58,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:20:58,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:20:58,627 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:20:58,627 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:20:58,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (1/1) ... [2025-02-06 09:20:58,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:58,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:58,657 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:20:58,659 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:20:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:20:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:20:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:20:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:20:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:20:58,677 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:20:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:20:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:20:58,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:20:58,678 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:20:58,804 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:20:58,805 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:20:58,993 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:20:58,993 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:20:59,011 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:20:59,011 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:20:59,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:59 BoogieIcfgContainer [2025-02-06 09:20:59,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:20:59,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:20:59,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:20:59,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:20:59,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:20:58" (1/3) ... [2025-02-06 09:20:59,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d8d26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:59, skipping insertion in model container [2025-02-06 09:20:59,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:58" (2/3) ... [2025-02-06 09:20:59,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d8d26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:59, skipping insertion in model container [2025-02-06 09:20:59,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:59" (3/3) ... [2025-02-06 09:20:59,019 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_13-equ_proc_nr.i [2025-02-06 09:20:59,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:20:59,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_13-equ_proc_nr.i that has 2 procedures, 81 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 09:20:59,033 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:20:59,083 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:20:59,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 81 transitions, 166 flow [2025-02-06 09:20:59,171 INFO L124 PetriNetUnfolderBase]: 1/80 cut-off events. [2025-02-06 09:20:59,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:20:59,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 80 events. 1/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-02-06 09:20:59,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 81 transitions, 166 flow [2025-02-06 09:20:59,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 80 transitions, 163 flow [2025-02-06 09:20:59,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:20:59,208 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;@6da2a6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:20:59,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 09:20:59,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:20:59,234 INFO L124 PetriNetUnfolderBase]: 1/60 cut-off events. [2025-02-06 09:20:59,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:20:59,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:59,235 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] [2025-02-06 09:20:59,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:20:59,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1104607147, now seen corresponding path program 1 times [2025-02-06 09:20:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:59,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650465090] [2025-02-06 09:20:59,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:59,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:20:59,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:20:59,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:59,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:00,244 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:21:00,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:00,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650465090] [2025-02-06 09:21:00,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650465090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:00,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:00,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846210334] [2025-02-06 09:21:00,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:00,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:00,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:00,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:00,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:00,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 81 [2025-02-06 09:21:00,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 64.5) internal successors, (387), 6 states have internal predecessors, (387), 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:21:00,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:00,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 81 [2025-02-06 09:21:00,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:00,637 INFO L124 PetriNetUnfolderBase]: 79/347 cut-off events. [2025-02-06 09:21:00,639 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:21:00,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 347 events. 79/347 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1541 event pairs, 25 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 484. Up to 130 conditions per place. [2025-02-06 09:21:00,644 INFO L140 encePairwiseOnDemand]: 70/81 looper letters, 21 selfloop transitions, 22 changer transitions 4/109 dead transitions. [2025-02-06 09:21:00,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 109 transitions, 315 flow [2025-02-06 09:21:00,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 426 transitions. [2025-02-06 09:21:00,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8765432098765432 [2025-02-06 09:21:00,659 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 163 flow. Second operand 6 states and 426 transitions. [2025-02-06 09:21:00,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 109 transitions, 315 flow [2025-02-06 09:21:00,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 109 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:21:00,669 INFO L231 Difference]: Finished difference. Result has 92 places, 101 transitions, 312 flow [2025-02-06 09:21:00,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=92, PETRI_TRANSITIONS=101} [2025-02-06 09:21:00,676 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2025-02-06 09:21:00,676 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 101 transitions, 312 flow [2025-02-06 09:21:00,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.5) internal successors, (387), 6 states have internal predecessors, (387), 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:21:00,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:00,676 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] [2025-02-06 09:21:00,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:21:00,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:00,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:00,680 INFO L85 PathProgramCache]: Analyzing trace with hash -737367968, now seen corresponding path program 1 times [2025-02-06 09:21:00,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:00,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075768301] [2025-02-06 09:21:00,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:00,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:00,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:21:00,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:21:00,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:00,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:01,035 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:21:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075768301] [2025-02-06 09:21:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075768301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:01,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453879244] [2025-02-06 09:21:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:01,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:01,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:01,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 81 [2025-02-06 09:21:01,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 101 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 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:21:01,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:01,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 81 [2025-02-06 09:21:01,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:01,282 INFO L124 PetriNetUnfolderBase]: 144/520 cut-off events. [2025-02-06 09:21:01,283 INFO L125 PetriNetUnfolderBase]: For 144/146 co-relation queries the response was YES. [2025-02-06 09:21:01,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 520 events. 144/520 cut-off events. For 144/146 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2611 event pairs, 43 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 1108. Up to 241 conditions per place. [2025-02-06 09:21:01,287 INFO L140 encePairwiseOnDemand]: 70/81 looper letters, 38 selfloop transitions, 29 changer transitions 7/136 dead transitions. [2025-02-06 09:21:01,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 136 transitions, 600 flow [2025-02-06 09:21:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 416 transitions. [2025-02-06 09:21:01,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8559670781893004 [2025-02-06 09:21:01,290 INFO L175 Difference]: Start difference. First operand has 92 places, 101 transitions, 312 flow. Second operand 6 states and 416 transitions. [2025-02-06 09:21:01,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 136 transitions, 600 flow [2025-02-06 09:21:01,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 136 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:01,298 INFO L231 Difference]: Finished difference. Result has 102 places, 125 transitions, 566 flow [2025-02-06 09:21:01,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=566, PETRI_PLACES=102, PETRI_TRANSITIONS=125} [2025-02-06 09:21:01,299 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 19 predicate places. [2025-02-06 09:21:01,299 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 125 transitions, 566 flow [2025-02-06 09:21:01,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 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:21:01,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:01,301 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:21:01,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:21:01,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:01,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:01,302 INFO L85 PathProgramCache]: Analyzing trace with hash 39838657, now seen corresponding path program 1 times [2025-02-06 09:21:01,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:01,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302243683] [2025-02-06 09:21:01,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:01,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:01,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:01,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:01,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:01,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:01,788 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:21:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302243683] [2025-02-06 09:21:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302243683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:01,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:21:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398481150] [2025-02-06 09:21:01,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:01,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:21:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:01,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:21:01,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:21:02,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 81 [2025-02-06 09:21:02,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 125 transitions, 566 flow. Second operand has 8 states, 8 states have (on average 63.75) internal successors, (510), 8 states have internal predecessors, (510), 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:21:02,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:02,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 81 [2025-02-06 09:21:02,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:02,250 INFO L124 PetriNetUnfolderBase]: 92/471 cut-off events. [2025-02-06 09:21:02,251 INFO L125 PetriNetUnfolderBase]: For 187/189 co-relation queries the response was YES. [2025-02-06 09:21:02,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 471 events. 92/471 cut-off events. For 187/189 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2437 event pairs, 14 based on Foata normal form. 4/471 useless extension candidates. Maximal degree in co-relation 906. Up to 84 conditions per place. [2025-02-06 09:21:02,254 INFO L140 encePairwiseOnDemand]: 70/81 looper letters, 17 selfloop transitions, 1 changer transitions 13/136 dead transitions. [2025-02-06 09:21:02,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 136 transitions, 650 flow [2025-02-06 09:21:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 09:21:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 09:21:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 529 transitions. [2025-02-06 09:21:02,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.816358024691358 [2025-02-06 09:21:02,258 INFO L175 Difference]: Start difference. First operand has 102 places, 125 transitions, 566 flow. Second operand 8 states and 529 transitions. [2025-02-06 09:21:02,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 136 transitions, 650 flow [2025-02-06 09:21:02,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 136 transitions, 632 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:02,273 INFO L231 Difference]: Finished difference. Result has 114 places, 123 transitions, 572 flow [2025-02-06 09:21:02,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=572, PETRI_PLACES=114, PETRI_TRANSITIONS=123} [2025-02-06 09:21:02,274 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 31 predicate places. [2025-02-06 09:21:02,274 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 123 transitions, 572 flow [2025-02-06 09:21:02,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 63.75) internal successors, (510), 8 states have internal predecessors, (510), 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:21:02,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:02,275 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:21:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:21:02,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:02,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:02,277 INFO L85 PathProgramCache]: Analyzing trace with hash 852415639, now seen corresponding path program 1 times [2025-02-06 09:21:02,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:02,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431784580] [2025-02-06 09:21:02,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:02,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:02,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:02,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:02,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:02,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:02,831 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:21:02,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:02,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431784580] [2025-02-06 09:21:02,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431784580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:02,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:02,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925871255] [2025-02-06 09:21:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:02,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:02,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:02,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:02,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:03,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:03,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 123 transitions, 572 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:03,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:03,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:03,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:04,115 INFO L124 PetriNetUnfolderBase]: 229/697 cut-off events. [2025-02-06 09:21:04,115 INFO L125 PetriNetUnfolderBase]: For 737/743 co-relation queries the response was YES. [2025-02-06 09:21:04,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 697 events. 229/697 cut-off events. For 737/743 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3616 event pairs, 27 based on Foata normal form. 10/704 useless extension candidates. Maximal degree in co-relation 2146. Up to 236 conditions per place. [2025-02-06 09:21:04,122 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 64 selfloop transitions, 36 changer transitions 48/198 dead transitions. [2025-02-06 09:21:04,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 198 transitions, 1266 flow [2025-02-06 09:21:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 09:21:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 09:21:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 806 transitions. [2025-02-06 09:21:04,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7107583774250441 [2025-02-06 09:21:04,128 INFO L175 Difference]: Start difference. First operand has 114 places, 123 transitions, 572 flow. Second operand 14 states and 806 transitions. [2025-02-06 09:21:04,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 198 transitions, 1266 flow [2025-02-06 09:21:04,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 198 transitions, 1247 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-02-06 09:21:04,138 INFO L231 Difference]: Finished difference. Result has 127 places, 131 transitions, 814 flow [2025-02-06 09:21:04,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=814, PETRI_PLACES=127, PETRI_TRANSITIONS=131} [2025-02-06 09:21:04,139 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 44 predicate places. [2025-02-06 09:21:04,139 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 131 transitions, 814 flow [2025-02-06 09:21:04,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:04,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:04,141 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:21:04,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:21:04,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:04,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2073143433, now seen corresponding path program 2 times [2025-02-06 09:21:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134310622] [2025-02-06 09:21:04,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:04,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:04,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:04,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:04,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:04,626 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:21:04,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:04,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134310622] [2025-02-06 09:21:04,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134310622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:04,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:04,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187729931] [2025-02-06 09:21:04,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:04,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:04,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:04,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:04,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:05,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:05,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 131 transitions, 814 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:05,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:05,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:05,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:05,760 INFO L124 PetriNetUnfolderBase]: 189/619 cut-off events. [2025-02-06 09:21:05,760 INFO L125 PetriNetUnfolderBase]: For 1565/1584 co-relation queries the response was YES. [2025-02-06 09:21:05,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 619 events. 189/619 cut-off events. For 1565/1584 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3192 event pairs, 44 based on Foata normal form. 18/633 useless extension candidates. Maximal degree in co-relation 2353. Up to 256 conditions per place. [2025-02-06 09:21:05,766 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 57 selfloop transitions, 39 changer transitions 37/183 dead transitions. [2025-02-06 09:21:05,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 183 transitions, 1404 flow [2025-02-06 09:21:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 09:21:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 09:21:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 754 transitions. [2025-02-06 09:21:05,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2025-02-06 09:21:05,769 INFO L175 Difference]: Start difference. First operand has 127 places, 131 transitions, 814 flow. Second operand 13 states and 754 transitions. [2025-02-06 09:21:05,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 183 transitions, 1404 flow [2025-02-06 09:21:05,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 183 transitions, 1363 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-02-06 09:21:05,795 INFO L231 Difference]: Finished difference. Result has 133 places, 128 transitions, 855 flow [2025-02-06 09:21:05,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=855, PETRI_PLACES=133, PETRI_TRANSITIONS=128} [2025-02-06 09:21:05,799 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 50 predicate places. [2025-02-06 09:21:05,800 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 128 transitions, 855 flow [2025-02-06 09:21:05,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:05,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:05,802 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:21:05,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:21:05,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:05,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1175257983, now seen corresponding path program 1 times [2025-02-06 09:21:05,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:05,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138748993] [2025-02-06 09:21:05,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:05,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:05,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:05,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:05,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:05,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:06,188 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:21:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:06,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138748993] [2025-02-06 09:21:06,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138748993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:06,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211282269] [2025-02-06 09:21:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:06,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:06,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:06,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:06,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:06,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:06,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 128 transitions, 855 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:06,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:06,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:06,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:07,203 INFO L124 PetriNetUnfolderBase]: 163/545 cut-off events. [2025-02-06 09:21:07,203 INFO L125 PetriNetUnfolderBase]: For 1720/1736 co-relation queries the response was YES. [2025-02-06 09:21:07,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 545 events. 163/545 cut-off events. For 1720/1736 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2690 event pairs, 23 based on Foata normal form. 13/554 useless extension candidates. Maximal degree in co-relation 2202. Up to 90 conditions per place. [2025-02-06 09:21:07,209 INFO L140 encePairwiseOnDemand]: 66/81 looper letters, 84 selfloop transitions, 38 changer transitions 14/183 dead transitions. [2025-02-06 09:21:07,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 183 transitions, 1610 flow [2025-02-06 09:21:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:21:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:21:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 671 transitions. [2025-02-06 09:21:07,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6903292181069959 [2025-02-06 09:21:07,212 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 855 flow. Second operand 12 states and 671 transitions. [2025-02-06 09:21:07,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 183 transitions, 1610 flow [2025-02-06 09:21:07,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 183 transitions, 1506 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-02-06 09:21:07,251 INFO L231 Difference]: Finished difference. Result has 129 places, 123 transitions, 856 flow [2025-02-06 09:21:07,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=856, PETRI_PLACES=129, PETRI_TRANSITIONS=123} [2025-02-06 09:21:07,251 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 46 predicate places. [2025-02-06 09:21:07,251 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 123 transitions, 856 flow [2025-02-06 09:21:07,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:07,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:07,252 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:21:07,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:21:07,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:07,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1041661479, now seen corresponding path program 3 times [2025-02-06 09:21:07,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:07,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102333384] [2025-02-06 09:21:07,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:21:07,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:07,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:07,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:07,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 09:21:07,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:07,707 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:21:07,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:07,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102333384] [2025-02-06 09:21:07,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102333384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:07,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:07,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:07,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203670151] [2025-02-06 09:21:07,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:07,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:07,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:07,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:08,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:08,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 123 transitions, 856 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:08,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:08,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:08,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:08,868 INFO L124 PetriNetUnfolderBase]: 169/524 cut-off events. [2025-02-06 09:21:08,869 INFO L125 PetriNetUnfolderBase]: For 1755/1779 co-relation queries the response was YES. [2025-02-06 09:21:08,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2358 conditions, 524 events. 169/524 cut-off events. For 1755/1779 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2411 event pairs, 32 based on Foata normal form. 23/543 useless extension candidates. Maximal degree in co-relation 2327. Up to 230 conditions per place. [2025-02-06 09:21:08,873 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 55 selfloop transitions, 42 changer transitions 28/171 dead transitions. [2025-02-06 09:21:08,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 171 transitions, 1450 flow [2025-02-06 09:21:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 09:21:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 09:21:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 802 transitions. [2025-02-06 09:21:08,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7072310405643739 [2025-02-06 09:21:08,876 INFO L175 Difference]: Start difference. First operand has 129 places, 123 transitions, 856 flow. Second operand 14 states and 802 transitions. [2025-02-06 09:21:08,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 171 transitions, 1450 flow [2025-02-06 09:21:08,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 171 transitions, 1330 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-02-06 09:21:08,889 INFO L231 Difference]: Finished difference. Result has 132 places, 124 transitions, 917 flow [2025-02-06 09:21:08,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=917, PETRI_PLACES=132, PETRI_TRANSITIONS=124} [2025-02-06 09:21:08,890 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 49 predicate places. [2025-02-06 09:21:08,891 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 124 transitions, 917 flow [2025-02-06 09:21:08,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:08,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:08,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] [2025-02-06 09:21:08,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:21:08,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:08,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1081407525, now seen corresponding path program 4 times [2025-02-06 09:21:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432437152] [2025-02-06 09:21:08,893 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:21:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:08,905 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-06 09:21:08,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 58 statements. [2025-02-06 09:21:08,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 09:21:08,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:09,225 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:21:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432437152] [2025-02-06 09:21:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432437152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:09,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:09,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140140268] [2025-02-06 09:21:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:09,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:09,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:09,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:09,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:09,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:09,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 124 transitions, 917 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:09,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:09,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:09,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:10,272 INFO L124 PetriNetUnfolderBase]: 171/558 cut-off events. [2025-02-06 09:21:10,272 INFO L125 PetriNetUnfolderBase]: For 2977/3000 co-relation queries the response was YES. [2025-02-06 09:21:10,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2501 conditions, 558 events. 171/558 cut-off events. For 2977/3000 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2709 event pairs, 27 based on Foata normal form. 19/575 useless extension candidates. Maximal degree in co-relation 2465. Up to 129 conditions per place. [2025-02-06 09:21:10,277 INFO L140 encePairwiseOnDemand]: 65/81 looper letters, 114 selfloop transitions, 37 changer transitions 12/209 dead transitions. [2025-02-06 09:21:10,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 209 transitions, 2018 flow [2025-02-06 09:21:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 833 transitions. [2025-02-06 09:21:10,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68559670781893 [2025-02-06 09:21:10,282 INFO L175 Difference]: Start difference. First operand has 132 places, 124 transitions, 917 flow. Second operand 15 states and 833 transitions. [2025-02-06 09:21:10,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 209 transitions, 2018 flow [2025-02-06 09:21:10,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 209 transitions, 1690 flow, removed 58 selfloop flow, removed 16 redundant places. [2025-02-06 09:21:10,297 INFO L231 Difference]: Finished difference. Result has 137 places, 147 transitions, 1080 flow [2025-02-06 09:21:10,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1080, PETRI_PLACES=137, PETRI_TRANSITIONS=147} [2025-02-06 09:21:10,300 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 54 predicate places. [2025-02-06 09:21:10,301 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 147 transitions, 1080 flow [2025-02-06 09:21:10,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:10,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:10,301 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:21:10,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:21:10,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash -436178463, now seen corresponding path program 5 times [2025-02-06 09:21:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:10,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748564040] [2025-02-06 09:21:10,303 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:21:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:10,313 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:10,321 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:10,321 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:10,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:10,674 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:21:10,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:10,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748564040] [2025-02-06 09:21:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748564040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:10,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:10,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84971014] [2025-02-06 09:21:10,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:10,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:10,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:10,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:11,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:11,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 147 transitions, 1080 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:11,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:11,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:11,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:11,629 INFO L124 PetriNetUnfolderBase]: 177/550 cut-off events. [2025-02-06 09:21:11,630 INFO L125 PetriNetUnfolderBase]: For 2499/2531 co-relation queries the response was YES. [2025-02-06 09:21:11,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2581 conditions, 550 events. 177/550 cut-off events. For 2499/2531 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2643 event pairs, 33 based on Foata normal form. 25/571 useless extension candidates. Maximal degree in co-relation 2542. Up to 263 conditions per place. [2025-02-06 09:21:11,634 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 71 selfloop transitions, 41 changer transitions 32/190 dead transitions. [2025-02-06 09:21:11,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 190 transitions, 1729 flow [2025-02-06 09:21:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 09:21:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 09:21:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 787 transitions. [2025-02-06 09:21:11,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6940035273368607 [2025-02-06 09:21:11,638 INFO L175 Difference]: Start difference. First operand has 137 places, 147 transitions, 1080 flow. Second operand 14 states and 787 transitions. [2025-02-06 09:21:11,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 190 transitions, 1729 flow [2025-02-06 09:21:11,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 190 transitions, 1657 flow, removed 12 selfloop flow, removed 10 redundant places. [2025-02-06 09:21:11,653 INFO L231 Difference]: Finished difference. Result has 144 places, 143 transitions, 1123 flow [2025-02-06 09:21:11,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1123, PETRI_PLACES=144, PETRI_TRANSITIONS=143} [2025-02-06 09:21:11,655 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 61 predicate places. [2025-02-06 09:21:11,655 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 143 transitions, 1123 flow [2025-02-06 09:21:11,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:11,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:11,655 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:21:11,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:21:11,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash -43389585, now seen corresponding path program 6 times [2025-02-06 09:21:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:11,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678344748] [2025-02-06 09:21:11,656 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 09:21:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:11,667 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:11,675 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:11,675 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 09:21:11,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:11,991 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:21:11,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678344748] [2025-02-06 09:21:11,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678344748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:11,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145885949] [2025-02-06 09:21:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:11,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:11,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:11,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:11,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:12,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:12,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 143 transitions, 1123 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:12,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:12,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:12,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:12,993 INFO L124 PetriNetUnfolderBase]: 212/657 cut-off events. [2025-02-06 09:21:12,993 INFO L125 PetriNetUnfolderBase]: For 4504/4543 co-relation queries the response was YES. [2025-02-06 09:21:12,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3110 conditions, 657 events. 212/657 cut-off events. For 4504/4543 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3478 event pairs, 32 based on Foata normal form. 28/682 useless extension candidates. Maximal degree in co-relation 3067. Up to 220 conditions per place. [2025-02-06 09:21:12,999 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 126 selfloop transitions, 50 changer transitions 16/238 dead transitions. [2025-02-06 09:21:13,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 238 transitions, 2375 flow [2025-02-06 09:21:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 838 transitions. [2025-02-06 09:21:13,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6897119341563785 [2025-02-06 09:21:13,004 INFO L175 Difference]: Start difference. First operand has 144 places, 143 transitions, 1123 flow. Second operand 15 states and 838 transitions. [2025-02-06 09:21:13,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 238 transitions, 2375 flow [2025-02-06 09:21:13,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 238 transitions, 2237 flow, removed 25 selfloop flow, removed 10 redundant places. [2025-02-06 09:21:13,022 INFO L231 Difference]: Finished difference. Result has 153 places, 170 transitions, 1521 flow [2025-02-06 09:21:13,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1521, PETRI_PLACES=153, PETRI_TRANSITIONS=170} [2025-02-06 09:21:13,024 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 70 predicate places. [2025-02-06 09:21:13,024 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 170 transitions, 1521 flow [2025-02-06 09:21:13,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:13,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:13,024 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:21:13,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:21:13,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:13,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1555094441, now seen corresponding path program 7 times [2025-02-06 09:21:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:13,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434270371] [2025-02-06 09:21:13,026 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 09:21:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:13,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:13,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:13,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:13,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:13,339 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:21:13,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:13,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434270371] [2025-02-06 09:21:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434270371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:13,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435513853] [2025-02-06 09:21:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:13,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:13,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:13,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:13,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:13,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 170 transitions, 1521 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:13,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:13,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:13,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:14,294 INFO L124 PetriNetUnfolderBase]: 246/735 cut-off events. [2025-02-06 09:21:14,294 INFO L125 PetriNetUnfolderBase]: For 5786/5825 co-relation queries the response was YES. [2025-02-06 09:21:14,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 735 events. 246/735 cut-off events. For 5786/5825 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4006 event pairs, 41 based on Foata normal form. 28/758 useless extension candidates. Maximal degree in co-relation 3682. Up to 257 conditions per place. [2025-02-06 09:21:14,302 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 143 selfloop transitions, 56 changer transitions 18/263 dead transitions. [2025-02-06 09:21:14,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 263 transitions, 2818 flow [2025-02-06 09:21:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 841 transitions. [2025-02-06 09:21:14,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6921810699588478 [2025-02-06 09:21:14,306 INFO L175 Difference]: Start difference. First operand has 153 places, 170 transitions, 1521 flow. Second operand 15 states and 841 transitions. [2025-02-06 09:21:14,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 263 transitions, 2818 flow [2025-02-06 09:21:14,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 263 transitions, 2724 flow, removed 35 selfloop flow, removed 8 redundant places. [2025-02-06 09:21:14,334 INFO L231 Difference]: Finished difference. Result has 166 places, 190 transitions, 1898 flow [2025-02-06 09:21:14,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1898, PETRI_PLACES=166, PETRI_TRANSITIONS=190} [2025-02-06 09:21:14,336 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 83 predicate places. [2025-02-06 09:21:14,336 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 190 transitions, 1898 flow [2025-02-06 09:21:14,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:14,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:14,337 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:21:14,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:21:14,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:14,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:14,338 INFO L85 PathProgramCache]: Analyzing trace with hash 498538627, now seen corresponding path program 8 times [2025-02-06 09:21:14,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:14,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081923771] [2025-02-06 09:21:14,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:14,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:14,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:14,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:14,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:14,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:14,641 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:21:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081923771] [2025-02-06 09:21:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081923771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:14,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081336992] [2025-02-06 09:21:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:14,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:14,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:14,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:15,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:15,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 190 transitions, 1898 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:15,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:15,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:15,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:15,543 INFO L124 PetriNetUnfolderBase]: 241/724 cut-off events. [2025-02-06 09:21:15,543 INFO L125 PetriNetUnfolderBase]: For 7822/7864 co-relation queries the response was YES. [2025-02-06 09:21:15,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 724 events. 241/724 cut-off events. For 7822/7864 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3883 event pairs, 23 based on Foata normal form. 35/758 useless extension candidates. Maximal degree in co-relation 4005. Up to 309 conditions per place. [2025-02-06 09:21:15,551 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 142 selfloop transitions, 54 changer transitions 19/261 dead transitions. [2025-02-06 09:21:15,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 261 transitions, 3113 flow [2025-02-06 09:21:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 836 transitions. [2025-02-06 09:21:15,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6880658436213992 [2025-02-06 09:21:15,553 INFO L175 Difference]: Start difference. First operand has 166 places, 190 transitions, 1898 flow. Second operand 15 states and 836 transitions. [2025-02-06 09:21:15,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 261 transitions, 3113 flow [2025-02-06 09:21:15,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 261 transitions, 2976 flow, removed 62 selfloop flow, removed 8 redundant places. [2025-02-06 09:21:15,584 INFO L231 Difference]: Finished difference. Result has 177 places, 203 transitions, 2173 flow [2025-02-06 09:21:15,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1793, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2173, PETRI_PLACES=177, PETRI_TRANSITIONS=203} [2025-02-06 09:21:15,585 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 94 predicate places. [2025-02-06 09:21:15,585 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 203 transitions, 2173 flow [2025-02-06 09:21:15,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:15,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:15,586 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:21:15,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:21:15,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:15,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:15,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1777119357, now seen corresponding path program 9 times [2025-02-06 09:21:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:15,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116248901] [2025-02-06 09:21:15,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:21:15,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:15,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:15,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:15,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 09:21:15,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:15,892 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:21:15,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:15,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116248901] [2025-02-06 09:21:15,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116248901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:15,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:15,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846193212] [2025-02-06 09:21:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:15,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:15,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:15,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:15,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:16,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:16,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 203 transitions, 2173 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:16,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:16,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:16,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:16,762 INFO L124 PetriNetUnfolderBase]: 218/686 cut-off events. [2025-02-06 09:21:16,762 INFO L125 PetriNetUnfolderBase]: For 8055/8099 co-relation queries the response was YES. [2025-02-06 09:21:16,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 686 events. 218/686 cut-off events. For 8055/8099 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3670 event pairs, 20 based on Foata normal form. 40/725 useless extension candidates. Maximal degree in co-relation 3818. Up to 340 conditions per place. [2025-02-06 09:21:16,768 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 123 selfloop transitions, 48 changer transitions 30/247 dead transitions. [2025-02-06 09:21:16,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 247 transitions, 3042 flow [2025-02-06 09:21:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 834 transitions. [2025-02-06 09:21:16,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6864197530864198 [2025-02-06 09:21:16,770 INFO L175 Difference]: Start difference. First operand has 177 places, 203 transitions, 2173 flow. Second operand 15 states and 834 transitions. [2025-02-06 09:21:16,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 247 transitions, 3042 flow [2025-02-06 09:21:16,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 247 transitions, 2911 flow, removed 46 selfloop flow, removed 9 redundant places. [2025-02-06 09:21:16,803 INFO L231 Difference]: Finished difference. Result has 186 places, 199 transitions, 2147 flow [2025-02-06 09:21:16,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2147, PETRI_PLACES=186, PETRI_TRANSITIONS=199} [2025-02-06 09:21:16,804 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 103 predicate places. [2025-02-06 09:21:16,804 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 199 transitions, 2147 flow [2025-02-06 09:21:16,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:16,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:16,804 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:21:16,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:21:16,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:16,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1968065439, now seen corresponding path program 10 times [2025-02-06 09:21:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:16,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555462978] [2025-02-06 09:21:16,806 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:21:16,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:16,812 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-06 09:21:16,815 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 58 statements. [2025-02-06 09:21:16,815 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 09:21:16,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:17,086 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:21:17,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555462978] [2025-02-06 09:21:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555462978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:17,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:17,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364795533] [2025-02-06 09:21:17,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:17,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:17,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:17,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:17,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:17,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 199 transitions, 2147 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:17,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:17,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:17,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:17,912 INFO L124 PetriNetUnfolderBase]: 212/684 cut-off events. [2025-02-06 09:21:17,912 INFO L125 PetriNetUnfolderBase]: For 8795/8835 co-relation queries the response was YES. [2025-02-06 09:21:17,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3866 conditions, 684 events. 212/684 cut-off events. For 8795/8835 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3704 event pairs, 27 based on Foata normal form. 44/726 useless extension candidates. Maximal degree in co-relation 3807. Up to 355 conditions per place. [2025-02-06 09:21:17,919 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 116 selfloop transitions, 58 changer transitions 26/246 dead transitions. [2025-02-06 09:21:17,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 246 transitions, 3001 flow [2025-02-06 09:21:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 842 transitions. [2025-02-06 09:21:17,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6930041152263374 [2025-02-06 09:21:17,921 INFO L175 Difference]: Start difference. First operand has 186 places, 199 transitions, 2147 flow. Second operand 15 states and 842 transitions. [2025-02-06 09:21:17,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 246 transitions, 3001 flow [2025-02-06 09:21:17,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 246 transitions, 2899 flow, removed 23 selfloop flow, removed 11 redundant places. [2025-02-06 09:21:17,956 INFO L231 Difference]: Finished difference. Result has 192 places, 201 transitions, 2271 flow [2025-02-06 09:21:17,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2271, PETRI_PLACES=192, PETRI_TRANSITIONS=201} [2025-02-06 09:21:17,958 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 109 predicate places. [2025-02-06 09:21:17,958 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 201 transitions, 2271 flow [2025-02-06 09:21:17,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:17,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:17,958 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:21:17,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:21:17,959 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:17,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1036623203, now seen corresponding path program 11 times [2025-02-06 09:21:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:17,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975869290] [2025-02-06 09:21:17,960 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:21:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:17,968 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:17,972 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:17,972 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:17,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:18,254 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:21:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975869290] [2025-02-06 09:21:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975869290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:18,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:18,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089921511] [2025-02-06 09:21:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:18,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:18,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:18,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:18,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:18,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:18,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 201 transitions, 2271 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:18,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:18,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:18,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:19,209 INFO L124 PetriNetUnfolderBase]: 250/796 cut-off events. [2025-02-06 09:21:19,209 INFO L125 PetriNetUnfolderBase]: For 12688/12728 co-relation queries the response was YES. [2025-02-06 09:21:19,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4809 conditions, 796 events. 250/796 cut-off events. For 12688/12728 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4569 event pairs, 33 based on Foata normal form. 31/825 useless extension candidates. Maximal degree in co-relation 4747. Up to 359 conditions per place. [2025-02-06 09:21:19,217 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 153 selfloop transitions, 62 changer transitions 13/274 dead transitions. [2025-02-06 09:21:19,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 274 transitions, 3705 flow [2025-02-06 09:21:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 838 transitions. [2025-02-06 09:21:19,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6897119341563785 [2025-02-06 09:21:19,219 INFO L175 Difference]: Start difference. First operand has 192 places, 201 transitions, 2271 flow. Second operand 15 states and 838 transitions. [2025-02-06 09:21:19,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 274 transitions, 3705 flow [2025-02-06 09:21:19,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 274 transitions, 3471 flow, removed 53 selfloop flow, removed 14 redundant places. [2025-02-06 09:21:19,254 INFO L231 Difference]: Finished difference. Result has 196 places, 222 transitions, 2675 flow [2025-02-06 09:21:19,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2675, PETRI_PLACES=196, PETRI_TRANSITIONS=222} [2025-02-06 09:21:19,255 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 113 predicate places. [2025-02-06 09:21:19,255 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 222 transitions, 2675 flow [2025-02-06 09:21:19,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:19,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:19,255 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:21:19,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:21:19,256 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:19,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash 666751813, now seen corresponding path program 12 times [2025-02-06 09:21:19,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:19,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215634678] [2025-02-06 09:21:19,256 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 09:21:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:19,263 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:19,268 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:19,268 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 09:21:19,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:19,545 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:21:19,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215634678] [2025-02-06 09:21:19,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215634678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:19,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:19,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:19,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581018377] [2025-02-06 09:21:19,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:19,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:19,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:19,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:20,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:20,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 222 transitions, 2675 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:20,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:20,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:20,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:20,520 INFO L124 PetriNetUnfolderBase]: 256/834 cut-off events. [2025-02-06 09:21:20,520 INFO L125 PetriNetUnfolderBase]: For 13097/13138 co-relation queries the response was YES. [2025-02-06 09:21:20,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5127 conditions, 834 events. 256/834 cut-off events. For 13097/13138 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4991 event pairs, 36 based on Foata normal form. 36/865 useless extension candidates. Maximal degree in co-relation 5063. Up to 444 conditions per place. [2025-02-06 09:21:20,527 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 138 selfloop transitions, 60 changer transitions 23/267 dead transitions. [2025-02-06 09:21:20,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 267 transitions, 3657 flow [2025-02-06 09:21:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 836 transitions. [2025-02-06 09:21:20,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6880658436213992 [2025-02-06 09:21:20,530 INFO L175 Difference]: Start difference. First operand has 196 places, 222 transitions, 2675 flow. Second operand 15 states and 836 transitions. [2025-02-06 09:21:20,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 267 transitions, 3657 flow [2025-02-06 09:21:20,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 267 transitions, 3499 flow, removed 71 selfloop flow, removed 7 redundant places. [2025-02-06 09:21:20,569 INFO L231 Difference]: Finished difference. Result has 207 places, 227 transitions, 2771 flow [2025-02-06 09:21:20,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2536, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2771, PETRI_PLACES=207, PETRI_TRANSITIONS=227} [2025-02-06 09:21:20,569 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 124 predicate places. [2025-02-06 09:21:20,569 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 227 transitions, 2771 flow [2025-02-06 09:21:20,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:20,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:20,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:20,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:21:20,570 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:20,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:20,571 INFO L85 PathProgramCache]: Analyzing trace with hash 670684887, now seen corresponding path program 13 times [2025-02-06 09:21:20,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:20,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130076680] [2025-02-06 09:21:20,571 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 09:21:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:20,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:20,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:20,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:20,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:20,851 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:21:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:20,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130076680] [2025-02-06 09:21:20,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130076680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:20,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:20,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252172112] [2025-02-06 09:21:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:20,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:20,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:20,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:21,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:21,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 227 transitions, 2771 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:21,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:21,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:21,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:21,759 INFO L124 PetriNetUnfolderBase]: 245/810 cut-off events. [2025-02-06 09:21:21,759 INFO L125 PetriNetUnfolderBase]: For 13695/13731 co-relation queries the response was YES. [2025-02-06 09:21:21,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 810 events. 245/810 cut-off events. For 13695/13731 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4795 event pairs, 36 based on Foata normal form. 35/837 useless extension candidates. Maximal degree in co-relation 4912. Up to 383 conditions per place. [2025-02-06 09:21:21,765 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 139 selfloop transitions, 67 changer transitions 26/278 dead transitions. [2025-02-06 09:21:21,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 278 transitions, 3896 flow [2025-02-06 09:21:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 837 transitions. [2025-02-06 09:21:21,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2025-02-06 09:21:21,767 INFO L175 Difference]: Start difference. First operand has 207 places, 227 transitions, 2771 flow. Second operand 15 states and 837 transitions. [2025-02-06 09:21:21,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 278 transitions, 3896 flow [2025-02-06 09:21:21,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 278 transitions, 3786 flow, removed 31 selfloop flow, removed 11 redundant places. [2025-02-06 09:21:21,806 INFO L231 Difference]: Finished difference. Result has 215 places, 227 transitions, 2911 flow [2025-02-06 09:21:21,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2700, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2911, PETRI_PLACES=215, PETRI_TRANSITIONS=227} [2025-02-06 09:21:21,806 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 132 predicate places. [2025-02-06 09:21:21,807 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 227 transitions, 2911 flow [2025-02-06 09:21:21,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:21,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:21,807 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:21:21,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:21:21,807 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:21,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:21,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1756442945, now seen corresponding path program 14 times [2025-02-06 09:21:21,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:21,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113489883] [2025-02-06 09:21:21,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:21,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:21,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:21,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:22,097 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:21:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113489883] [2025-02-06 09:21:22,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113489883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:22,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:22,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284196571] [2025-02-06 09:21:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:22,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:22,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:22,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:22,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:22,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:22,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 227 transitions, 2911 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:22,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:22,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:22,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:22,969 INFO L124 PetriNetUnfolderBase]: 230/778 cut-off events. [2025-02-06 09:21:22,970 INFO L125 PetriNetUnfolderBase]: For 13615/13655 co-relation queries the response was YES. [2025-02-06 09:21:22,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 778 events. 230/778 cut-off events. For 13615/13655 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4586 event pairs, 38 based on Foata normal form. 27/795 useless extension candidates. Maximal degree in co-relation 4778. Up to 443 conditions per place. [2025-02-06 09:21:22,976 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 137 selfloop transitions, 55 changer transitions 15/253 dead transitions. [2025-02-06 09:21:22,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 253 transitions, 3622 flow [2025-02-06 09:21:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 09:21:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 09:21:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 773 transitions. [2025-02-06 09:21:22,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.681657848324515 [2025-02-06 09:21:22,978 INFO L175 Difference]: Start difference. First operand has 215 places, 227 transitions, 2911 flow. Second operand 14 states and 773 transitions. [2025-02-06 09:21:22,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 253 transitions, 3622 flow [2025-02-06 09:21:23,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 253 transitions, 3475 flow, removed 56 selfloop flow, removed 8 redundant places. [2025-02-06 09:21:23,020 INFO L231 Difference]: Finished difference. Result has 221 places, 228 transitions, 2930 flow [2025-02-06 09:21:23,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2776, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2930, PETRI_PLACES=221, PETRI_TRANSITIONS=228} [2025-02-06 09:21:23,020 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 138 predicate places. [2025-02-06 09:21:23,020 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 228 transitions, 2930 flow [2025-02-06 09:21:23,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:23,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:23,021 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:21:23,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:21:23,021 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash -490304565, now seen corresponding path program 15 times [2025-02-06 09:21:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:23,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928117739] [2025-02-06 09:21:23,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:21:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:23,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:21:23,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:21:23,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 09:21:23,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:23,387 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:21:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:23,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928117739] [2025-02-06 09:21:23,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928117739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:23,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:23,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234496945] [2025-02-06 09:21:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:23,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:23,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:23,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:23,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:23,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 228 transitions, 2930 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:23,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:23,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:23,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:24,247 INFO L124 PetriNetUnfolderBase]: 221/754 cut-off events. [2025-02-06 09:21:24,247 INFO L125 PetriNetUnfolderBase]: For 13564/13594 co-relation queries the response was YES. [2025-02-06 09:21:24,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4638 conditions, 754 events. 221/754 cut-off events. For 13564/13594 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4394 event pairs, 38 based on Foata normal form. 28/769 useless extension candidates. Maximal degree in co-relation 4566. Up to 408 conditions per place. [2025-02-06 09:21:24,252 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 135 selfloop transitions, 55 changer transitions 29/265 dead transitions. [2025-02-06 09:21:24,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 265 transitions, 3835 flow [2025-02-06 09:21:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 831 transitions. [2025-02-06 09:21:24,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6839506172839506 [2025-02-06 09:21:24,254 INFO L175 Difference]: Start difference. First operand has 221 places, 228 transitions, 2930 flow. Second operand 15 states and 831 transitions. [2025-02-06 09:21:24,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 265 transitions, 3835 flow [2025-02-06 09:21:24,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 265 transitions, 3678 flow, removed 32 selfloop flow, removed 12 redundant places. [2025-02-06 09:21:24,292 INFO L231 Difference]: Finished difference. Result has 227 places, 221 transitions, 2801 flow [2025-02-06 09:21:24,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2805, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2801, PETRI_PLACES=227, PETRI_TRANSITIONS=221} [2025-02-06 09:21:24,293 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 144 predicate places. [2025-02-06 09:21:24,293 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 221 transitions, 2801 flow [2025-02-06 09:21:24,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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:21:24,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:24,294 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:21:24,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:21:24,294 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:24,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash 905020589, now seen corresponding path program 1 times [2025-02-06 09:21:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:24,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215421526] [2025-02-06 09:21:24,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:24,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:21:24,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:21:24,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:24,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:24,565 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:21:24,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:24,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215421526] [2025-02-06 09:21:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215421526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:24,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:24,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356028076] [2025-02-06 09:21:24,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:24,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:24,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:24,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:25,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:25,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 221 transitions, 2801 flow. Second operand has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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:21:25,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:25,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:25,447 INFO L124 PetriNetUnfolderBase]: 208/740 cut-off events. [2025-02-06 09:21:25,447 INFO L125 PetriNetUnfolderBase]: For 12030/12056 co-relation queries the response was YES. [2025-02-06 09:21:25,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4330 conditions, 740 events. 208/740 cut-off events. For 12030/12056 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4323 event pairs, 16 based on Foata normal form. 13/749 useless extension candidates. Maximal degree in co-relation 4257. Up to 223 conditions per place. [2025-02-06 09:21:25,451 INFO L140 encePairwiseOnDemand]: 67/81 looper letters, 123 selfloop transitions, 64 changer transitions 29/262 dead transitions. [2025-02-06 09:21:25,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 262 transitions, 3727 flow [2025-02-06 09:21:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 09:21:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 09:21:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 977 transitions. [2025-02-06 09:21:25,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700960219478738 [2025-02-06 09:21:25,453 INFO L175 Difference]: Start difference. First operand has 227 places, 221 transitions, 2801 flow. Second operand 18 states and 977 transitions. [2025-02-06 09:21:25,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 262 transitions, 3727 flow [2025-02-06 09:21:25,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 262 transitions, 3614 flow, removed 40 selfloop flow, removed 12 redundant places. [2025-02-06 09:21:25,492 INFO L231 Difference]: Finished difference. Result has 224 places, 210 transitions, 2657 flow [2025-02-06 09:21:25,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2732, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2657, PETRI_PLACES=224, PETRI_TRANSITIONS=210} [2025-02-06 09:21:25,493 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 141 predicate places. [2025-02-06 09:21:25,493 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 210 transitions, 2657 flow [2025-02-06 09:21:25,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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:21:25,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:25,493 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:21:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:21:25,493 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1357399037, now seen corresponding path program 2 times [2025-02-06 09:21:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306711410] [2025-02-06 09:21:25,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:25,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:21:25,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:21:25,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:25,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:25,732 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:21:25,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:25,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306711410] [2025-02-06 09:21:25,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306711410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:25,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:25,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013512201] [2025-02-06 09:21:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:25,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:25,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:25,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:25,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:26,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:26,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 210 transitions, 2657 flow. Second operand has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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:21:26,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:26,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:26,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:26,467 INFO L124 PetriNetUnfolderBase]: 195/717 cut-off events. [2025-02-06 09:21:26,467 INFO L125 PetriNetUnfolderBase]: For 12780/12806 co-relation queries the response was YES. [2025-02-06 09:21:26,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4181 conditions, 717 events. 195/717 cut-off events. For 12780/12806 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4182 event pairs, 16 based on Foata normal form. 13/726 useless extension candidates. Maximal degree in co-relation 4108. Up to 223 conditions per place. [2025-02-06 09:21:26,472 INFO L140 encePairwiseOnDemand]: 67/81 looper letters, 113 selfloop transitions, 56 changer transitions 37/252 dead transitions. [2025-02-06 09:21:26,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 252 transitions, 3632 flow [2025-02-06 09:21:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 09:21:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 09:21:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1077 transitions. [2025-02-06 09:21:26,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6648148148148149 [2025-02-06 09:21:26,473 INFO L175 Difference]: Start difference. First operand has 224 places, 210 transitions, 2657 flow. Second operand 20 states and 1077 transitions. [2025-02-06 09:21:26,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 252 transitions, 3632 flow [2025-02-06 09:21:26,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 252 transitions, 3425 flow, removed 34 selfloop flow, removed 17 redundant places. [2025-02-06 09:21:26,510 INFO L231 Difference]: Finished difference. Result has 228 places, 198 transitions, 2431 flow [2025-02-06 09:21:26,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2512, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2431, PETRI_PLACES=228, PETRI_TRANSITIONS=198} [2025-02-06 09:21:26,510 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 145 predicate places. [2025-02-06 09:21:26,510 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 198 transitions, 2431 flow [2025-02-06 09:21:26,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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:21:26,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:26,511 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:21:26,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:21:26,511 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:21:26,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1120277057, now seen corresponding path program 3 times [2025-02-06 09:21:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:26,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402028054] [2025-02-06 09:21:26,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:21:26,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:26,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:21:26,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:21:26,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 09:21:26,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:26,762 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:21:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402028054] [2025-02-06 09:21:26,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402028054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:26,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:26,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529723207] [2025-02-06 09:21:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:26,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:26,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:26,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:27,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-02-06 09:21:27,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 198 transitions, 2431 flow. Second operand has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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:21:27,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:27,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-02-06 09:21:27,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:27,628 INFO L124 PetriNetUnfolderBase]: 155/602 cut-off events. [2025-02-06 09:21:27,628 INFO L125 PetriNetUnfolderBase]: For 10891/10917 co-relation queries the response was YES. [2025-02-06 09:21:27,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3393 conditions, 602 events. 155/602 cut-off events. For 10891/10917 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3326 event pairs, 2 based on Foata normal form. 43/645 useless extension candidates. Maximal degree in co-relation 3326. Up to 159 conditions per place. [2025-02-06 09:21:27,631 INFO L140 encePairwiseOnDemand]: 67/81 looper letters, 0 selfloop transitions, 0 changer transitions 260/260 dead transitions. [2025-02-06 09:21:27,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 260 transitions, 3520 flow [2025-02-06 09:21:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 09:21:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-06 09:21:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1282 transitions. [2025-02-06 09:21:27,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6594650205761317 [2025-02-06 09:21:27,633 INFO L175 Difference]: Start difference. First operand has 228 places, 198 transitions, 2431 flow. Second operand 24 states and 1282 transitions. [2025-02-06 09:21:27,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 260 transitions, 3520 flow [2025-02-06 09:21:27,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 260 transitions, 3255 flow, removed 47 selfloop flow, removed 22 redundant places. [2025-02-06 09:21:27,661 INFO L231 Difference]: Finished difference. Result has 214 places, 0 transitions, 0 flow [2025-02-06 09:21:27,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=0, PETRI_PLACES=214, PETRI_TRANSITIONS=0} [2025-02-06 09:21:27,662 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 131 predicate places. [2025-02-06 09:21:27,662 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 0 transitions, 0 flow [2025-02-06 09:21:27,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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:21:27,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2025-02-06 09:21:27,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-02-06 09:21:27,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2025-02-06 09:21:27,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2025-02-06 09:21:27,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:21:27,665 INFO L422 BasicCegarLoop]: Path program histogram: [15, 3, 1, 1, 1, 1] [2025-02-06 09:21:27,670 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:21:27,670 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:21:27,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:21:27 BasicIcfg [2025-02-06 09:21:27,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:21:27,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:21:27,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:21:27,674 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:21:27,675 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:59" (3/4) ... [2025-02-06 09:21:27,676 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:21:27,679 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-06 09:21:27,681 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:21:27,681 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 09:21:27,681 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 09:21:27,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:21:27,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:21:27,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:21:27,755 INFO L158 Benchmark]: Toolchain (without parser) took 29692.48ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 126.7MB in the beginning and 312.7MB in the end (delta: -186.0MB). Peak memory consumption was 203.4MB. Max. memory is 16.1GB. [2025-02-06 09:21:27,756 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:21:27,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.73ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 99.0MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:21:27,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.29ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:21:27,758 INFO L158 Benchmark]: Boogie Preprocessor took 19.45ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 95.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:21:27,758 INFO L158 Benchmark]: IcfgBuilder took 384.39ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 80.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:21:27,759 INFO L158 Benchmark]: TraceAbstraction took 28660.96ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 79.8MB in the beginning and 114.1MB in the end (delta: -34.4MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2025-02-06 09:21:27,759 INFO L158 Benchmark]: Witness Printer took 80.10ms. Allocated memory is still 352.3MB. Free memory was 114.1MB in the beginning and 312.7MB in the end (delta: -198.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:21:27,760 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.73ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 99.0MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.29ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.45ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 95.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 384.39ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 80.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28660.96ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 79.8MB in the beginning and 114.1MB in the end (delta: -34.4MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. * Witness Printer took 80.10ms. Allocated memory is still 352.3MB. Free memory was 114.1MB in the beginning and 312.7MB in the end (delta: -198.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 999]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 994]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 99 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.6s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7931 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6856 mSDsluCounter, 14553 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13923 mSDsCounter, 650 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26580 IncrementalHoareTripleChecker+Invalid, 27230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 650 mSolverCounterUnsat, 630 mSDtfsCounter, 26580 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 463 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2930occurred in iteration=18, InterpolantAutomatonStates: 313, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1278 NumberOfCodeBlocks, 1260 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1256 ConstructedInterpolants, 0 QuantifiedInterpolants, 8729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:21:27,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE