./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:39:47,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:39:47,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:39:47,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:39:47,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:39:47,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:39:47,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:39:47,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:39:47,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:39:47,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:39:47,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:39:47,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:39:47,206 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:39:47,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:39:47,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:39:47,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:39:47,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:39:47,208 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 [2025-03-08 21:39:47,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:39:47,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:39:47,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:39:47,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:39:47,449 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:39:47,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2025-03-08 21:39:48,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d1f252d/0e44e5eda6e142e0ac50a62817ac0976/FLAG6c1e41054 [2025-03-08 21:39:48,845 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:39:48,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2025-03-08 21:39:48,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d1f252d/0e44e5eda6e142e0ac50a62817ac0976/FLAG6c1e41054 [2025-03-08 21:39:49,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d1f252d/0e44e5eda6e142e0ac50a62817ac0976 [2025-03-08 21:39:49,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:39:49,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:39:49,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:39:49,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:39:49,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:39:49,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2712d2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49, skipping insertion in model container [2025-03-08 21:39:49,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:39:49,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:39:49,369 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:39:49,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:39:49,417 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:39:49,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49 WrapperNode [2025-03-08 21:39:49,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:39:49,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:39:49,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:39:49,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:39:49,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,438 INFO L138 Inliner]: procedures = 168, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-03-08 21:39:49,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:39:49,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:39:49,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:39:49,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:39:49,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:39:49,450 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:39:49,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:39:49,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:39:49,451 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (1/1) ... [2025-03-08 21:39:49,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:39:49,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:39:49,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:39:49,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:39:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-08 21:39:49,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-08 21:39:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 21:39:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:39:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:39:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 21:39:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:39:49,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:39:49,502 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:39:49,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:39:49,597 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:39:49,680 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:39:49,680 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:39:49,724 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:39:49,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:39:49,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:49 BoogieIcfgContainer [2025-03-08 21:39:49,726 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:39:49,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:39:49,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:39:49,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:39:49,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:39:49" (1/3) ... [2025-03-08 21:39:49,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4910369e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:49, skipping insertion in model container [2025-03-08 21:39:49,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:49" (2/3) ... [2025-03-08 21:39:49,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4910369e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:49, skipping insertion in model container [2025-03-08 21:39:49,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:49" (3/3) ... [2025-03-08 21:39:49,734 INFO L128 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2025-03-08 21:39:49,744 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:39:49,746 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 46_monabsex2_vs.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 5 error locations. [2025-03-08 21:39:49,746 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:39:49,780 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:39:49,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 66 flow [2025-03-08 21:39:49,829 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2025-03-08 21:39:49,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:39:49,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-08 21:39:49,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 66 flow [2025-03-08 21:39:49,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 31 transitions, 66 flow [2025-03-08 21:39:49,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:39:49,851 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;@5e8fafdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:39:49,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 21:39:49,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:39:49,859 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 21:39:49,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:39:49,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:49,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:49,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-08 21:39:49,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1133374889, now seen corresponding path program 1 times [2025-03-08 21:39:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:49,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609627440] [2025-03-08 21:39:49,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:49,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 21:39:49,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 21:39:49,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:49,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:39:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:39:50,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:39:50,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609627440] [2025-03-08 21:39:50,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609627440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:39:50,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:39:50,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:39:50,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8632915] [2025-03-08 21:39:50,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:39:50,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:39:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:39:50,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:39:50,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:39:50,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 31 [2025-03-08 21:39:50,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:50,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:39:50,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 31 [2025-03-08 21:39:50,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:39:50,063 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-08 21:39:50,064 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:39:50,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 0/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 5/30 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-03-08 21:39:50,067 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 4 selfloop transitions, 0 changer transitions 0/22 dead transitions. [2025-03-08 21:39:50,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 56 flow [2025-03-08 21:39:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:39:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:39:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2025-03-08 21:39:50,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387096774193549 [2025-03-08 21:39:50,078 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 66 flow. Second operand 2 states and 52 transitions. [2025-03-08 21:39:50,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 56 flow [2025-03-08 21:39:50,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 56 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:39:50,083 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 48 flow [2025-03-08 21:39:50,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-08 21:39:50,088 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -8 predicate places. [2025-03-08 21:39:50,088 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 48 flow [2025-03-08 21:39:50,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:50,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:50,088 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:50,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:39:50,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-08 21:39:50,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1748834258, now seen corresponding path program 1 times [2025-03-08 21:39:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:50,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965072452] [2025-03-08 21:39:50,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:50,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 21:39:50,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 21:39:50,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:50,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:39:50,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 21:39:50,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 21:39:50,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:50,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:39:50,146 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:39:50,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-08 21:39:50,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-08 21:39:50,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-08 21:39:50,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-08 21:39:50,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-08 21:39:50,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-08 21:39:50,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-08 21:39:50,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-08 21:39:50,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-08 21:39:50,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-08 21:39:50,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-08 21:39:50,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:39:50,151 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 21:39:50,153 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:39:50,154 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 21:39:50,179 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:39:50,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 96 flow [2025-03-08 21:39:50,193 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2025-03-08 21:39:50,194 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:39:50,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 57 events. 0/57 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 121 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-03-08 21:39:50,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 43 transitions, 96 flow [2025-03-08 21:39:50,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 43 transitions, 96 flow [2025-03-08 21:39:50,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:39:50,196 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;@5e8fafdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:39:50,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-08 21:39:50,202 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:39:50,202 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-08 21:39:50,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:39:50,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:50,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:50,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 21:39:50,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:50,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1441075841, now seen corresponding path program 1 times [2025-03-08 21:39:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:50,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896474612] [2025-03-08 21:39:50,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:50,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 21:39:50,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 21:39:50,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:39:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:39:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:39:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896474612] [2025-03-08 21:39:50,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896474612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:39:50,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:39:50,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:39:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928704849] [2025-03-08 21:39:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:39:50,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:39:50,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:39:50,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:39:50,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:39:50,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 43 [2025-03-08 21:39:50,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:50,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:39:50,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 43 [2025-03-08 21:39:50,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:39:50,289 INFO L124 PetriNetUnfolderBase]: 12/69 cut-off events. [2025-03-08 21:39:50,291 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-08 21:39:50,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 69 events. 12/69 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 159 event pairs, 12 based on Foata normal form. 21/89 useless extension candidates. Maximal degree in co-relation 65. Up to 33 conditions per place. [2025-03-08 21:39:50,292 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 8 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2025-03-08 21:39:50,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 84 flow [2025-03-08 21:39:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:39:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:39:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2025-03-08 21:39:50,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7790697674418605 [2025-03-08 21:39:50,294 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 96 flow. Second operand 2 states and 67 transitions. [2025-03-08 21:39:50,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 84 flow [2025-03-08 21:39:50,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:39:50,295 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 68 flow [2025-03-08 21:39:50,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-03-08 21:39:50,296 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -13 predicate places. [2025-03-08 21:39:50,296 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 68 flow [2025-03-08 21:39:50,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:50,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:50,296 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:50,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:39:50,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 21:39:50,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash 432801090, now seen corresponding path program 1 times [2025-03-08 21:39:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:50,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769501953] [2025-03-08 21:39:50,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:50,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 21:39:50,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 21:39:50,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:50,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:39:50,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 21:39:50,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 21:39:50,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:50,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:39:50,324 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:39:50,324 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-08 21:39:50,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-08 21:39:50,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-08 21:39:50,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-08 21:39:50,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-08 21:39:50,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-08 21:39:50,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:39:50,326 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 21:39:50,326 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:39:50,326 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 21:39:50,349 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:39:50,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 55 transitions, 128 flow [2025-03-08 21:39:50,363 INFO L124 PetriNetUnfolderBase]: 0/76 cut-off events. [2025-03-08 21:39:50,364 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 21:39:50,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 76 events. 0/76 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 198 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-03-08 21:39:50,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 55 transitions, 128 flow [2025-03-08 21:39:50,365 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 55 transitions, 128 flow [2025-03-08 21:39:50,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:39:50,368 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;@5e8fafdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:39:50,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-08 21:39:50,374 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:39:50,375 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 21:39:50,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:39:50,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:50,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:50,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 21:39:50,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1837375487, now seen corresponding path program 1 times [2025-03-08 21:39:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:50,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212323077] [2025-03-08 21:39:50,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:50,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:50,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 21:39:50,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 21:39:50,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:39:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:39:50,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:39:50,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212323077] [2025-03-08 21:39:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212323077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:39:50,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:39:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:39:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351379561] [2025-03-08 21:39:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:39:50,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:39:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:39:50,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:39:50,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:39:50,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2025-03-08 21:39:50,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 128 flow. Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:50,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:39:50,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2025-03-08 21:39:50,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:39:50,487 INFO L124 PetriNetUnfolderBase]: 108/285 cut-off events. [2025-03-08 21:39:50,487 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-08 21:39:50,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 285 events. 108/285 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1322 event pairs, 108 based on Foata normal form. 85/367 useless extension candidates. Maximal degree in co-relation 346. Up to 193 conditions per place. [2025-03-08 21:39:50,492 INFO L140 encePairwiseOnDemand]: 39/55 looper letters, 12 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-03-08 21:39:50,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 114 flow [2025-03-08 21:39:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:39:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:39:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2025-03-08 21:39:50,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2025-03-08 21:39:50,494 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 128 flow. Second operand 2 states and 82 transitions. [2025-03-08 21:39:50,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 114 flow [2025-03-08 21:39:50,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 112 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-08 21:39:50,495 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 88 flow [2025-03-08 21:39:50,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-03-08 21:39:50,496 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -18 predicate places. [2025-03-08 21:39:50,496 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 88 flow [2025-03-08 21:39:50,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:50,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:50,496 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:50,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:39:50,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 21:39:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 565074937, now seen corresponding path program 1 times [2025-03-08 21:39:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205141952] [2025-03-08 21:39:50,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:50,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 21:39:50,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 21:39:50,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:50,518 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:39:50,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 21:39:50,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 21:39:50,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:50,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:39:50,535 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:39:50,535 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-03-08 21:39:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-03-08 21:39:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-03-08 21:39:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-03-08 21:39:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-03-08 21:39:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-03-08 21:39:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-03-08 21:39:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-03-08 21:39:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-03-08 21:39:50,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-03-08 21:39:50,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-03-08 21:39:50,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-03-08 21:39:50,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-03-08 21:39:50,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-03-08 21:39:50,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-03-08 21:39:50,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-03-08 21:39:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-03-08 21:39:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-03-08 21:39:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-03-08 21:39:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-03-08 21:39:50,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-03-08 21:39:50,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:39:50,539 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 21:39:50,539 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:39:50,539 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 21:39:50,561 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:39:50,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 67 transitions, 162 flow [2025-03-08 21:39:50,573 INFO L124 PetriNetUnfolderBase]: 0/95 cut-off events. [2025-03-08 21:39:50,574 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 21:39:50,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 95 events. 0/95 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-03-08 21:39:50,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 67 transitions, 162 flow [2025-03-08 21:39:50,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 67 transitions, 162 flow [2025-03-08 21:39:50,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:39:50,576 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;@5e8fafdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:39:50,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-08 21:39:50,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:39:50,578 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-08 21:39:50,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:39:50,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:50,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:50,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:39:50,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash -55523345, now seen corresponding path program 1 times [2025-03-08 21:39:50,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:50,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933966462] [2025-03-08 21:39:50,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:50,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 21:39:50,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 21:39:50,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:39:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:39:50,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:39:50,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933966462] [2025-03-08 21:39:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933966462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:39:50,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:39:50,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:39:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573916037] [2025-03-08 21:39:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:39:50,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:39:50,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:39:50,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:39:50,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:39:50,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 67 [2025-03-08 21:39:50,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 162 flow. Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:50,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:39:50,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 67 [2025-03-08 21:39:50,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:39:50,794 INFO L124 PetriNetUnfolderBase]: 684/1333 cut-off events. [2025-03-08 21:39:50,794 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2025-03-08 21:39:50,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 1333 events. 684/1333 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8136 event pairs, 684 based on Foata normal form. 341/1668 useless extension candidates. Maximal degree in co-relation 1755. Up to 1025 conditions per place. [2025-03-08 21:39:50,806 INFO L140 encePairwiseOnDemand]: 46/67 looper letters, 16 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2025-03-08 21:39:50,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 146 flow [2025-03-08 21:39:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:39:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:39:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2025-03-08 21:39:50,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2025-03-08 21:39:50,809 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 162 flow. Second operand 2 states and 97 transitions. [2025-03-08 21:39:50,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 146 flow [2025-03-08 21:39:50,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 43 transitions, 140 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-08 21:39:50,811 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 108 flow [2025-03-08 21:39:50,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-03-08 21:39:50,812 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -23 predicate places. [2025-03-08 21:39:50,813 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 108 flow [2025-03-08 21:39:50,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:50,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:50,813 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:50,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:39:50,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:39:50,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:50,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2096389549, now seen corresponding path program 1 times [2025-03-08 21:39:50,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:50,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127556017] [2025-03-08 21:39:50,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:50,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:39:50,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:39:50,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:50,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:39:50,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:39:50,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:39:50,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:50,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:39:50,851 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:39:50,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-03-08 21:39:50,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2025-03-08 21:39:50,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-03-08 21:39:50,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-03-08 21:39:50,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-03-08 21:39:50,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-03-08 21:39:50,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:39:50,853 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 21:39:50,853 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:39:50,853 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-08 21:39:50,885 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:39:50,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 79 transitions, 198 flow [2025-03-08 21:39:50,897 INFO L124 PetriNetUnfolderBase]: 0/114 cut-off events. [2025-03-08 21:39:50,897 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-08 21:39:50,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 114 events. 0/114 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 315 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-03-08 21:39:50,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 79 transitions, 198 flow [2025-03-08 21:39:50,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 79 transitions, 198 flow [2025-03-08 21:39:50,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:39:50,899 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;@5e8fafdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:39:50,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-08 21:39:50,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:39:50,901 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 21:39:50,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:39:50,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:50,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:50,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-08 21:39:50,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash -390487767, now seen corresponding path program 1 times [2025-03-08 21:39:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:50,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851376099] [2025-03-08 21:39:50,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:50,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 21:39:50,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 21:39:50,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:50,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:39:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:39:50,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:39:50,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851376099] [2025-03-08 21:39:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851376099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:39:50,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:39:50,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:39:50,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925478322] [2025-03-08 21:39:50,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:39:50,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:39:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:39:50,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:39:50,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:39:50,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 79 [2025-03-08 21:39:50,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 198 flow. Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:50,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:39:50,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 79 [2025-03-08 21:39:50,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:39:51,502 INFO L124 PetriNetUnfolderBase]: 3756/6285 cut-off events. [2025-03-08 21:39:51,503 INFO L125 PetriNetUnfolderBase]: For 4599/4599 co-relation queries the response was YES. [2025-03-08 21:39:51,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13346 conditions, 6285 events. 3756/6285 cut-off events. For 4599/4599 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 43508 event pairs, 3756 based on Foata normal form. 1365/7640 useless extension candidates. Maximal degree in co-relation 8540. Up to 5121 conditions per place. [2025-03-08 21:39:51,552 INFO L140 encePairwiseOnDemand]: 53/79 looper letters, 20 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2025-03-08 21:39:51,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 180 flow [2025-03-08 21:39:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:39:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:39:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2025-03-08 21:39:51,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7088607594936709 [2025-03-08 21:39:51,556 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 198 flow. Second operand 2 states and 112 transitions. [2025-03-08 21:39:51,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 180 flow [2025-03-08 21:39:51,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 168 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-08 21:39:51,558 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 128 flow [2025-03-08 21:39:51,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=128, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2025-03-08 21:39:51,561 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -28 predicate places. [2025-03-08 21:39:51,562 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 128 flow [2025-03-08 21:39:51,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:51,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:51,562 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:51,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:39:51,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-08 21:39:51,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1796329040, now seen corresponding path program 1 times [2025-03-08 21:39:51,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:51,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400499821] [2025-03-08 21:39:51,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:51,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:39:51,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:39:51,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:51,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:51,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:39:51,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:39:51,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:39:51,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:51,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:51,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:39:51,601 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:39:51,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-03-08 21:39:51,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-03-08 21:39:51,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-03-08 21:39:51,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-03-08 21:39:51,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-03-08 21:39:51,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-03-08 21:39:51,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-03-08 21:39:51,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-03-08 21:39:51,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-03-08 21:39:51,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-03-08 21:39:51,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:39:51,603 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 21:39:51,603 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:39:51,603 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-08 21:39:51,634 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:39:51,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 91 transitions, 236 flow [2025-03-08 21:39:51,650 INFO L124 PetriNetUnfolderBase]: 0/133 cut-off events. [2025-03-08 21:39:51,650 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-08 21:39:51,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 133 events. 0/133 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 387 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-03-08 21:39:51,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 91 transitions, 236 flow [2025-03-08 21:39:51,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 91 transitions, 236 flow [2025-03-08 21:39:51,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:39:51,653 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;@5e8fafdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:39:51,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-08 21:39:51,656 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:39:51,656 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 21:39:51,656 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:39:51,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:51,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:51,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-08 21:39:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1452699599, now seen corresponding path program 1 times [2025-03-08 21:39:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:51,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146528432] [2025-03-08 21:39:51,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:51,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 21:39:51,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 21:39:51,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:51,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:39:51,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-03-08 21:39:51,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:39:51,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146528432] [2025-03-08 21:39:51,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146528432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:39:51,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:39:51,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:39:51,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830357315] [2025-03-08 21:39:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:39:51,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:39:51,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:39:51,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:39:51,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:39:51,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 91 [2025-03-08 21:39:51,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 91 transitions, 236 flow. Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:51,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:39:51,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 91 [2025-03-08 21:39:51,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:39:53,886 INFO L124 PetriNetUnfolderBase]: 19116/29157 cut-off events. [2025-03-08 21:39:53,887 INFO L125 PetriNetUnfolderBase]: For 26108/26108 co-relation queries the response was YES. [2025-03-08 21:39:53,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62843 conditions, 29157 events. 19116/29157 cut-off events. For 26108/26108 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 218212 event pairs, 19116 based on Foata normal form. 5461/34603 useless extension candidates. Maximal degree in co-relation 40285. Up to 24577 conditions per place. [2025-03-08 21:39:54,085 INFO L140 encePairwiseOnDemand]: 60/91 looper letters, 24 selfloop transitions, 0 changer transitions 0/57 dead transitions. [2025-03-08 21:39:54,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 216 flow [2025-03-08 21:39:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:39:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:39:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 127 transitions. [2025-03-08 21:39:54,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6978021978021978 [2025-03-08 21:39:54,088 INFO L175 Difference]: Start difference. First operand has 104 places, 91 transitions, 236 flow. Second operand 2 states and 127 transitions. [2025-03-08 21:39:54,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 216 flow [2025-03-08 21:39:54,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 57 transitions, 196 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-03-08 21:39:54,099 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 148 flow [2025-03-08 21:39:54,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=148, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2025-03-08 21:39:54,100 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -33 predicate places. [2025-03-08 21:39:54,100 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 148 flow [2025-03-08 21:39:54,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:54,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:54,101 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:54,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:39:54,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-08 21:39:54,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -369420816, now seen corresponding path program 1 times [2025-03-08 21:39:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474796840] [2025-03-08 21:39:54,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:54,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 21:39:54,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 21:39:54,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:54,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:54,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:39:54,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 21:39:54,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 21:39:54,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:39:54,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:39:54,149 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:39:54,149 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2025-03-08 21:39:54,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-03-08 21:39:54,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-03-08 21:39:54,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-03-08 21:39:54,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-03-08 21:39:54,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-03-08 21:39:54,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-03-08 21:39:54,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-03-08 21:39:54,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-03-08 21:39:54,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-03-08 21:39:54,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-03-08 21:39:54,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:39:54,151 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 21:39:54,151 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:39:54,151 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-08 21:39:54,191 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:39:54,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 103 transitions, 276 flow [2025-03-08 21:39:54,209 INFO L124 PetriNetUnfolderBase]: 0/152 cut-off events. [2025-03-08 21:39:54,209 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-08 21:39:54,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 152 events. 0/152 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 473 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-03-08 21:39:54,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 103 transitions, 276 flow [2025-03-08 21:39:54,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 103 transitions, 276 flow [2025-03-08 21:39:54,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:39:54,212 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;@5e8fafdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:39:54,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-03-08 21:39:54,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:39:54,214 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-08 21:39:54,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:39:54,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:39:54,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:39:54,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-08 21:39:54,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:39:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1179072161, now seen corresponding path program 1 times [2025-03-08 21:39:54,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:39:54,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200637951] [2025-03-08 21:39:54,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:39:54,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:39:54,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 21:39:54,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 21:39:54,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:39:54,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:39:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:39:54,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:39:54,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200637951] [2025-03-08 21:39:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200637951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:39:54,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:39:54,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:39:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968138512] [2025-03-08 21:39:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:39:54,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:39:54,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:39:54,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:39:54,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:39:54,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 103 [2025-03-08 21:39:54,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 103 transitions, 276 flow. Second operand has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:39:54,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:39:54,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 103 [2025-03-08 21:39:54,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:40:02,986 INFO L124 PetriNetUnfolderBase]: 92844/132925 cut-off events. [2025-03-08 21:40:02,986 INFO L125 PetriNetUnfolderBase]: For 140802/140802 co-relation queries the response was YES. [2025-03-08 21:40:03,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289492 conditions, 132925 events. 92844/132925 cut-off events. For 140802/140802 co-relation queries the response was YES. Maximal size of possible extension queue 5166. Compared 1045965 event pairs, 92844 based on Foata normal form. 21845/154749 useless extension candidates. Maximal degree in co-relation 185694. Up to 114689 conditions per place. [2025-03-08 21:40:03,991 INFO L140 encePairwiseOnDemand]: 67/103 looper letters, 28 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2025-03-08 21:40:03,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 64 transitions, 254 flow [2025-03-08 21:40:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:40:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:40:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2025-03-08 21:40:03,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6893203883495146 [2025-03-08 21:40:03,992 INFO L175 Difference]: Start difference. First operand has 118 places, 103 transitions, 276 flow. Second operand 2 states and 142 transitions. [2025-03-08 21:40:03,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 64 transitions, 254 flow [2025-03-08 21:40:04,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 64 transitions, 224 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-03-08 21:40:04,018 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 168 flow [2025-03-08 21:40:04,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=168, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2025-03-08 21:40:04,019 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -38 predicate places. [2025-03-08 21:40:04,019 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 168 flow [2025-03-08 21:40:04,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:40:04,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:40:04,020 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:40:04,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:40:04,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-08 21:40:04,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:40:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1284370227, now seen corresponding path program 1 times [2025-03-08 21:40:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:40:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420349788] [2025-03-08 21:40:04,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:40:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:40:04,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 21:40:04,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 21:40:04,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:40:04,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:40:04,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:40:04,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 21:40:04,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 21:40:04,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:40:04,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:40:04,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:40:04,050 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (39 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (38 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (37 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (36 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (35 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (34 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (33 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (32 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (31 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (30 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (23 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (22 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 41 remaining) [2025-03-08 21:40:04,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (14 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 41 remaining) [2025-03-08 21:40:04,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 41 remaining) [2025-03-08 21:40:04,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:40:04,051 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 21:40:04,052 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:40:04,052 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-03-08 21:40:04,085 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:40:04,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 115 transitions, 318 flow [2025-03-08 21:40:04,094 INFO L124 PetriNetUnfolderBase]: 0/171 cut-off events. [2025-03-08 21:40:04,094 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-08 21:40:04,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 171 events. 0/171 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 536 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2025-03-08 21:40:04,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 115 transitions, 318 flow [2025-03-08 21:40:04,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 115 transitions, 318 flow [2025-03-08 21:40:04,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:40:04,097 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;@5e8fafdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:40:04,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-08 21:40:04,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:40:04,098 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-08 21:40:04,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:40:04,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:40:04,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:40:04,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:40:04,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:40:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1211372897, now seen corresponding path program 1 times [2025-03-08 21:40:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:40:04,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432561632] [2025-03-08 21:40:04,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:40:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:40:04,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 21:40:04,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 21:40:04,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:40:04,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:40:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:40:04,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:40:04,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432561632] [2025-03-08 21:40:04,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432561632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:40:04,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:40:04,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:40:04,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188339366] [2025-03-08 21:40:04,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:40:04,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:40:04,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:40:04,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:40:04,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:40:04,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 115 [2025-03-08 21:40:04,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 115 transitions, 318 flow. Second operand has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:40:04,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:40:04,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 115 [2025-03-08 21:40:04,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand