./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-100.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:39:17,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:39:17,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:39:17,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:39:17,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:39:17,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:39:17,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:39:17,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:39:17,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:39:17,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:39:17,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:39:17,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:39:17,402 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:39:17,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:39:17,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:39:17,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:39:17,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:39:17,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:39:17,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:39:17,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:39:17,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:39:17,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:39:17,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:39:17,405 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-02-06 09:39:17,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:39:17,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:39:17,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:39:17,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:39:17,633 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:39:17,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-02-06 09:39:18,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0350cf54/95b761d8ad1547a49c5b381262cb067e/FLAGe70133147 [2025-02-06 09:39:19,154 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:39:19,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-02-06 09:39:19,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0350cf54/95b761d8ad1547a49c5b381262cb067e/FLAGe70133147 [2025-02-06 09:39:19,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0350cf54/95b761d8ad1547a49c5b381262cb067e [2025-02-06 09:39:19,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:39:19,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:39:19,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:39:19,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:39:19,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:39:19,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f14245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19, skipping insertion in model container [2025-02-06 09:39:19,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:39:19,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:39:19,662 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:39:19,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:39:19,710 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:39:19,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19 WrapperNode [2025-02-06 09:39:19,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:39:19,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:39:19,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:39:19,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:39:19,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,731 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-02-06 09:39:19,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:39:19,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:39:19,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:39:19,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:39:19,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:39:19,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:39:19,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:39:19,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:39:19,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (1/1) ... [2025-02-06 09:39:19,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:39:19,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:39:19,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:39:19,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:39:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:39:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-06 09:39:19,795 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-06 09:39:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-06 09:39:19,795 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-06 09:39:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:39:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:39:19,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:39:19,796 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:39:19,889 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:39:19,891 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:39:20,042 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:39:20,043 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:39:20,057 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:39:20,058 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:39:20,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:39:20 BoogieIcfgContainer [2025-02-06 09:39:20,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:39:20,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:39:20,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:39:20,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:39:20,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:39:19" (1/3) ... [2025-02-06 09:39:20,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65abf28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:39:20, skipping insertion in model container [2025-02-06 09:39:20,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:39:19" (2/3) ... [2025-02-06 09:39:20,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65abf28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:39:20, skipping insertion in model container [2025-02-06 09:39:20,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:39:20" (3/3) ... [2025-02-06 09:39:20,067 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-02-06 09:39:20,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:39:20,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 99 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-02-06 09:39:20,082 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:39:20,142 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:20,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 105 transitions, 218 flow [2025-02-06 09:39:20,222 INFO L124 PetriNetUnfolderBase]: 10/154 cut-off events. [2025-02-06 09:39:20,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:20,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 154 events. 10/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 269 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2025-02-06 09:39:20,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 105 transitions, 218 flow [2025-02-06 09:39:20,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 88 transitions, 183 flow [2025-02-06 09:39:20,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:20,244 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:20,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 09:39:20,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:20,251 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:20,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:20,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:20,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:20,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:39:20,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1019133262, now seen corresponding path program 1 times [2025-02-06 09:39:20,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:20,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5634812] [2025-02-06 09:39:20,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:20,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:20,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:20,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:20,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:20,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5634812] [2025-02-06 09:39:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5634812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:20,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:20,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:20,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322644401] [2025-02-06 09:39:20,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:20,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:20,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:20,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:20,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:20,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2025-02-06 09:39:20,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:20,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:20,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2025-02-06 09:39:20,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:20,474 INFO L124 PetriNetUnfolderBase]: 11/144 cut-off events. [2025-02-06 09:39:20,474 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:39:20,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 144 events. 11/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 295 event pairs, 8 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 101. Up to 33 conditions per place. [2025-02-06 09:39:20,476 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 13 selfloop transitions, 2 changer transitions 1/85 dead transitions. [2025-02-06 09:39:20,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 207 flow [2025-02-06 09:39:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2025-02-06 09:39:20,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-02-06 09:39:20,485 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 183 flow. Second operand 3 states and 270 transitions. [2025-02-06 09:39:20,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 207 flow [2025-02-06 09:39:20,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:20,523 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 178 flow [2025-02-06 09:39:20,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2025-02-06 09:39:20,529 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-02-06 09:39:20,530 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 178 flow [2025-02-06 09:39:20,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:20,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:20,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:20,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:39:20,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:39:20,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:20,531 INFO L85 PathProgramCache]: Analyzing trace with hash 124929558, now seen corresponding path program 1 times [2025-02-06 09:39:20,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:20,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818302843] [2025-02-06 09:39:20,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:20,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:20,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:39:20,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:39:20,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:20,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:20,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:20,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818302843] [2025-02-06 09:39:20,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818302843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:20,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:20,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918286649] [2025-02-06 09:39:20,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:20,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:20,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:20,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:20,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:20,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-02-06 09:39:20,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:20,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:20,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-02-06 09:39:20,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:20,687 INFO L124 PetriNetUnfolderBase]: 7/126 cut-off events. [2025-02-06 09:39:20,688 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:39:20,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 126 events. 7/126 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 223 event pairs, 4 based on Foata normal form. 3/121 useless extension candidates. Maximal degree in co-relation 144. Up to 25 conditions per place. [2025-02-06 09:39:20,689 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 11 selfloop transitions, 1 changer transitions 24/79 dead transitions. [2025-02-06 09:39:20,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 196 flow [2025-02-06 09:39:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-02-06 09:39:20,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-02-06 09:39:20,693 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 178 flow. Second operand 3 states and 259 transitions. [2025-02-06 09:39:20,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 196 flow [2025-02-06 09:39:20,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:20,697 INFO L231 Difference]: Finished difference. Result has 84 places, 55 transitions, 116 flow [2025-02-06 09:39:20,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=84, PETRI_TRANSITIONS=55} [2025-02-06 09:39:20,698 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-02-06 09:39:20,698 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 55 transitions, 116 flow [2025-02-06 09:39:20,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:20,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:20,699 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:20,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:39:20,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:39:20,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:20,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1155517015, now seen corresponding path program 1 times [2025-02-06 09:39:20,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:20,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348204962] [2025-02-06 09:39:20,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:20,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:20,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:39:20,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:39:20,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:20,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:20,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:20,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348204962] [2025-02-06 09:39:20,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348204962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:20,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:20,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:39:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190727522] [2025-02-06 09:39:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:20,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:39:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:20,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:39:20,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:39:20,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2025-02-06 09:39:20,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 55 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:20,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:20,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2025-02-06 09:39:20,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:20,932 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2025-02-06 09:39:20,934 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:39:20,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 61 events. 0/61 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-02-06 09:39:20,934 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 7 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-02-06 09:39:20,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 134 flow [2025-02-06 09:39:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:39:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:39:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-02-06 09:39:20,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547619047619047 [2025-02-06 09:39:20,938 INFO L175 Difference]: Start difference. First operand has 84 places, 55 transitions, 116 flow. Second operand 4 states and 359 transitions. [2025-02-06 09:39:20,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 134 flow [2025-02-06 09:39:20,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 54 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:20,942 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 119 flow [2025-02-06 09:39:20,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-02-06 09:39:20,943 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -29 predicate places. [2025-02-06 09:39:20,943 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 119 flow [2025-02-06 09:39:20,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:20,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:20,944 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:20,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:39:20,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:39:20,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1276553398, now seen corresponding path program 1 times [2025-02-06 09:39:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:20,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335831391] [2025-02-06 09:39:20,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:20,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:39:20,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:39:20,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:20,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:20,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:39:20,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:39:20,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:39:20,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:20,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:20,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:39:21,000 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:39:21,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-06 09:39:21,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-06 09:39:21,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-06 09:39:21,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-06 09:39:21,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-06 09:39:21,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-06 09:39:21,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-02-06 09:39:21,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-06 09:39:21,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-06 09:39:21,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:39:21,003 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:39:21,004 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:39:21,005 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:39:21,025 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:21,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 141 transitions, 302 flow [2025-02-06 09:39:21,043 INFO L124 PetriNetUnfolderBase]: 14/217 cut-off events. [2025-02-06 09:39:21,043 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:39:21,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 217 events. 14/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 471 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 228. Up to 6 conditions per place. [2025-02-06 09:39:21,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 141 transitions, 302 flow [2025-02-06 09:39:21,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 95 transitions, 203 flow [2025-02-06 09:39:21,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:21,046 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:21,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 09:39:21,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:21,047 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:21,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:21,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:21,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:21,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:39:21,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1341896210, now seen corresponding path program 1 times [2025-02-06 09:39:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:21,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51450718] [2025-02-06 09:39:21,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:21,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:21,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:21,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:21,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51450718] [2025-02-06 09:39:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51450718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:21,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:21,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058974452] [2025-02-06 09:39:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:21,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:21,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:21,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:21,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 141 [2025-02-06 09:39:21,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:21,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 141 [2025-02-06 09:39:21,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:21,120 INFO L124 PetriNetUnfolderBase]: 38/268 cut-off events. [2025-02-06 09:39:21,120 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 09:39:21,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 268 events. 38/268 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 905 event pairs, 34 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 185. Up to 83 conditions per place. [2025-02-06 09:39:21,122 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 15 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-02-06 09:39:21,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 231 flow [2025-02-06 09:39:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-02-06 09:39:21,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8486997635933806 [2025-02-06 09:39:21,123 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 203 flow. Second operand 3 states and 359 transitions. [2025-02-06 09:39:21,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 231 flow [2025-02-06 09:39:21,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 92 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:21,125 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 198 flow [2025-02-06 09:39:21,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2025-02-06 09:39:21,126 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2025-02-06 09:39:21,126 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 198 flow [2025-02-06 09:39:21,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:21,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:21,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:39:21,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:39:21,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1125336669, now seen corresponding path program 1 times [2025-02-06 09:39:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186251280] [2025-02-06 09:39:21,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:21,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:39:21,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:39:21,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186251280] [2025-02-06 09:39:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186251280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:21,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250743194] [2025-02-06 09:39:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:21,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:21,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:21,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:21,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 141 [2025-02-06 09:39:21,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:21,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 141 [2025-02-06 09:39:21,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:21,211 INFO L124 PetriNetUnfolderBase]: 26/230 cut-off events. [2025-02-06 09:39:21,211 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:39:21,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 230 events. 26/230 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 707 event pairs, 22 based on Foata normal form. 7/220 useless extension candidates. Maximal degree in co-relation 300. Up to 63 conditions per place. [2025-02-06 09:39:21,212 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 13 selfloop transitions, 1 changer transitions 18/86 dead transitions. [2025-02-06 09:39:21,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 86 transitions, 220 flow [2025-02-06 09:39:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-02-06 09:39:21,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8085106382978723 [2025-02-06 09:39:21,214 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 198 flow. Second operand 3 states and 342 transitions. [2025-02-06 09:39:21,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 86 transitions, 220 flow [2025-02-06 09:39:21,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 86 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:21,215 INFO L231 Difference]: Finished difference. Result has 93 places, 68 transitions, 148 flow [2025-02-06 09:39:21,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=93, PETRI_TRANSITIONS=68} [2025-02-06 09:39:21,217 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -6 predicate places. [2025-02-06 09:39:21,217 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 68 transitions, 148 flow [2025-02-06 09:39:21,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:21,217 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:21,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:39:21,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:39:21,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash 413144191, now seen corresponding path program 1 times [2025-02-06 09:39:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:21,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341408601] [2025-02-06 09:39:21,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:21,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:21,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 09:39:21,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 09:39:21,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:21,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341408601] [2025-02-06 09:39:21,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341408601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:21,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:21,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:39:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596328342] [2025-02-06 09:39:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:39:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:21,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:39:21,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:39:21,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 141 [2025-02-06 09:39:21,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 68 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:21,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 141 [2025-02-06 09:39:21,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:21,320 INFO L124 PetriNetUnfolderBase]: 2/107 cut-off events. [2025-02-06 09:39:21,320 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 09:39:21,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 107 events. 2/107 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 2 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 112. Up to 12 conditions per place. [2025-02-06 09:39:21,321 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 9 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2025-02-06 09:39:21,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 170 flow [2025-02-06 09:39:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:39:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:39:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2025-02-06 09:39:21,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528368794326241 [2025-02-06 09:39:21,323 INFO L175 Difference]: Start difference. First operand has 93 places, 68 transitions, 148 flow. Second operand 4 states and 481 transitions. [2025-02-06 09:39:21,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 170 flow [2025-02-06 09:39:21,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 67 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:21,324 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 151 flow [2025-02-06 09:39:21,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2025-02-06 09:39:21,324 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -23 predicate places. [2025-02-06 09:39:21,324 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 151 flow [2025-02-06 09:39:21,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:21,325 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:21,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:39:21,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:39:21,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1701477389, now seen corresponding path program 1 times [2025-02-06 09:39:21,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:21,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663855952] [2025-02-06 09:39:21,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:21,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:21,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:39:21,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:39:21,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:21,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:39:21,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:39:21,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:39:21,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:21,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:39:21,351 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:39:21,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 09:39:21,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-06 09:39:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-06 09:39:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-06 09:39:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-06 09:39:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-06 09:39:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2025-02-06 09:39:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-06 09:39:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-06 09:39:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-06 09:39:21,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:39:21,352 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:39:21,353 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:39:21,353 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:39:21,379 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:21,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 177 transitions, 390 flow [2025-02-06 09:39:21,402 INFO L124 PetriNetUnfolderBase]: 18/280 cut-off events. [2025-02-06 09:39:21,402 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:39:21,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 280 events. 18/280 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 664 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 297. Up to 8 conditions per place. [2025-02-06 09:39:21,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 177 transitions, 390 flow [2025-02-06 09:39:21,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 102 transitions, 225 flow [2025-02-06 09:39:21,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:21,406 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:21,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 09:39:21,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:21,409 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:21,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:21,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:21,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:21,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:39:21,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1359959822, now seen corresponding path program 1 times [2025-02-06 09:39:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:21,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058727586] [2025-02-06 09:39:21,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:21,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:21,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:21,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058727586] [2025-02-06 09:39:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058727586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:21,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:21,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451183430] [2025-02-06 09:39:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:21,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:21,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:21,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:21,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 177 [2025-02-06 09:39:21,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:21,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 177 [2025-02-06 09:39:21,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:21,534 INFO L124 PetriNetUnfolderBase]: 115/514 cut-off events. [2025-02-06 09:39:21,535 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-06 09:39:21,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 514 events. 115/514 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2380 event pairs, 110 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 384. Up to 207 conditions per place. [2025-02-06 09:39:21,537 INFO L140 encePairwiseOnDemand]: 172/177 looper letters, 17 selfloop transitions, 2 changer transitions 1/99 dead transitions. [2025-02-06 09:39:21,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 257 flow [2025-02-06 09:39:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2025-02-06 09:39:21,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8436911487758946 [2025-02-06 09:39:21,539 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 225 flow. Second operand 3 states and 448 transitions. [2025-02-06 09:39:21,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 257 flow [2025-02-06 09:39:21,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 99 transitions, 254 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:21,541 INFO L231 Difference]: Finished difference. Result has 108 places, 98 transitions, 218 flow [2025-02-06 09:39:21,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=108, PETRI_TRANSITIONS=98} [2025-02-06 09:39:21,541 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 0 predicate places. [2025-02-06 09:39:21,541 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 98 transitions, 218 flow [2025-02-06 09:39:21,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:21,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:21,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:39:21,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:39:21,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash -136115884, now seen corresponding path program 1 times [2025-02-06 09:39:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:21,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737413042] [2025-02-06 09:39:21,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:21,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:39:21,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:39:21,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:21,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737413042] [2025-02-06 09:39:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737413042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:21,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:21,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894457712] [2025-02-06 09:39:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:21,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:21,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:21,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:21,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:21,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 177 [2025-02-06 09:39:21,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 98 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:21,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 177 [2025-02-06 09:39:21,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:21,616 INFO L124 PetriNetUnfolderBase]: 83/432 cut-off events. [2025-02-06 09:39:21,616 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 09:39:21,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 432 events. 83/432 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1878 event pairs, 78 based on Foata normal form. 15/417 useless extension candidates. Maximal degree in co-relation 626. Up to 159 conditions per place. [2025-02-06 09:39:21,618 INFO L140 encePairwiseOnDemand]: 171/177 looper letters, 15 selfloop transitions, 1 changer transitions 18/93 dead transitions. [2025-02-06 09:39:21,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 93 transitions, 244 flow [2025-02-06 09:39:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2025-02-06 09:39:21,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800376647834275 [2025-02-06 09:39:21,619 INFO L175 Difference]: Start difference. First operand has 108 places, 98 transitions, 218 flow. Second operand 3 states and 425 transitions. [2025-02-06 09:39:21,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 93 transitions, 244 flow [2025-02-06 09:39:21,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 93 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:21,621 INFO L231 Difference]: Finished difference. Result has 102 places, 75 transitions, 168 flow [2025-02-06 09:39:21,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=102, PETRI_TRANSITIONS=75} [2025-02-06 09:39:21,621 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -6 predicate places. [2025-02-06 09:39:21,621 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 75 transitions, 168 flow [2025-02-06 09:39:21,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:21,622 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:21,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:39:21,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:39:21,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash -868210790, now seen corresponding path program 1 times [2025-02-06 09:39:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:21,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727179341] [2025-02-06 09:39:21,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:21,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 09:39:21,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 09:39:21,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:21,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:21,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727179341] [2025-02-06 09:39:21,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727179341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:21,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:21,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:39:21,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174028872] [2025-02-06 09:39:21,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:21,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:39:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:21,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:39:21,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:39:21,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 177 [2025-02-06 09:39:21,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 75 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:21,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 177 [2025-02-06 09:39:21,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:21,762 INFO L124 PetriNetUnfolderBase]: 10/159 cut-off events. [2025-02-06 09:39:21,762 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-06 09:39:21,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 159 events. 10/159 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 300 event pairs, 10 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 192. Up to 28 conditions per place. [2025-02-06 09:39:21,763 INFO L140 encePairwiseOnDemand]: 173/177 looper letters, 11 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-02-06 09:39:21,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 74 transitions, 194 flow [2025-02-06 09:39:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:39:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:39:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2025-02-06 09:39:21,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8516949152542372 [2025-02-06 09:39:21,765 INFO L175 Difference]: Start difference. First operand has 102 places, 75 transitions, 168 flow. Second operand 4 states and 603 transitions. [2025-02-06 09:39:21,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 74 transitions, 194 flow [2025-02-06 09:39:21,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 74 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:21,767 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 171 flow [2025-02-06 09:39:21,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2025-02-06 09:39:21,768 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -23 predicate places. [2025-02-06 09:39:21,768 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 171 flow [2025-02-06 09:39:21,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:21,770 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:21,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:39:21,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:39:21,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1479516985, now seen corresponding path program 1 times [2025-02-06 09:39:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:21,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162470778] [2025-02-06 09:39:21,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:21,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 09:39:21,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 09:39:21,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:21,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:39:21,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 09:39:21,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 09:39:21,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:21,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:39:21,811 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:39:21,811 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 09:39:21,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-06 09:39:21,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-06 09:39:21,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-06 09:39:21,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-06 09:39:21,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-02-06 09:39:21,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-02-06 09:39:21,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-06 09:39:21,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-06 09:39:21,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-06 09:39:21,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-06 09:39:21,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:39:21,812 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:39:21,812 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:39:21,812 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 09:39:21,837 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:21,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 213 transitions, 482 flow [2025-02-06 09:39:21,857 INFO L124 PetriNetUnfolderBase]: 22/343 cut-off events. [2025-02-06 09:39:21,858 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 09:39:21,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 343 events. 22/343 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 869 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 367. Up to 10 conditions per place. [2025-02-06 09:39:21,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 213 transitions, 482 flow [2025-02-06 09:39:21,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 249 flow [2025-02-06 09:39:21,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:21,860 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:21,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 09:39:21,861 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:21,861 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:21,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:21,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:21,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:21,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:39:21,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash -534766766, now seen corresponding path program 1 times [2025-02-06 09:39:21,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:21,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929565358] [2025-02-06 09:39:21,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:21,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:21,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:21,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:21,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:21,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:21,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929565358] [2025-02-06 09:39:21,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929565358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:21,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:21,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941077576] [2025-02-06 09:39:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:21,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:21,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:21,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 213 [2025-02-06 09:39:21,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:21,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:21,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 213 [2025-02-06 09:39:21,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:22,008 INFO L124 PetriNetUnfolderBase]: 316/1028 cut-off events. [2025-02-06 09:39:22,008 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-02-06 09:39:22,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 1028 events. 316/1028 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5808 event pairs, 310 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 835. Up to 503 conditions per place. [2025-02-06 09:39:22,014 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 19 selfloop transitions, 2 changer transitions 1/106 dead transitions. [2025-02-06 09:39:22,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 106 transitions, 285 flow [2025-02-06 09:39:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2025-02-06 09:39:22,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8403755868544601 [2025-02-06 09:39:22,016 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 249 flow. Second operand 3 states and 537 transitions. [2025-02-06 09:39:22,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 106 transitions, 285 flow [2025-02-06 09:39:22,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 106 transitions, 278 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:22,018 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 238 flow [2025-02-06 09:39:22,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2025-02-06 09:39:22,019 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2025-02-06 09:39:22,019 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 238 flow [2025-02-06 09:39:22,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:22,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:22,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:39:22,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:39:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1202375383, now seen corresponding path program 1 times [2025-02-06 09:39:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366189256] [2025-02-06 09:39:22,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:22,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:39:22,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:39:22,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:22,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:22,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:22,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366189256] [2025-02-06 09:39:22,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366189256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:22,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:22,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329968652] [2025-02-06 09:39:22,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:22,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:22,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:22,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:22,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:22,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2025-02-06 09:39:22,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:22,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2025-02-06 09:39:22,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:22,145 INFO L124 PetriNetUnfolderBase]: 236/850 cut-off events. [2025-02-06 09:39:22,146 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-06 09:39:22,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 850 events. 236/850 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4567 event pairs, 230 based on Foata normal form. 31/834 useless extension candidates. Maximal degree in co-relation 1332. Up to 391 conditions per place. [2025-02-06 09:39:22,149 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 17 selfloop transitions, 1 changer transitions 18/100 dead transitions. [2025-02-06 09:39:22,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 100 transitions, 268 flow [2025-02-06 09:39:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2025-02-06 09:39:22,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7949921752738655 [2025-02-06 09:39:22,151 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 238 flow. Second operand 3 states and 508 transitions. [2025-02-06 09:39:22,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 100 transitions, 268 flow [2025-02-06 09:39:22,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:22,153 INFO L231 Difference]: Finished difference. Result has 111 places, 82 transitions, 188 flow [2025-02-06 09:39:22,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2025-02-06 09:39:22,154 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -6 predicate places. [2025-02-06 09:39:22,154 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 188 flow [2025-02-06 09:39:22,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:22,154 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:22,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:39:22,155 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:39:22,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 747087162, now seen corresponding path program 1 times [2025-02-06 09:39:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:22,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943960184] [2025-02-06 09:39:22,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:22,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:39:22,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:39:22,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:22,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:22,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:22,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943960184] [2025-02-06 09:39:22,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943960184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:22,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:22,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:39:22,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467254294] [2025-02-06 09:39:22,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:22,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:39:22,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:22,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:39:22,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:39:22,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 213 [2025-02-06 09:39:22,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:22,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 213 [2025-02-06 09:39:22,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:22,280 INFO L124 PetriNetUnfolderBase]: 34/251 cut-off events. [2025-02-06 09:39:22,281 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-06 09:39:22,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 251 events. 34/251 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 749 event pairs, 34 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 348. Up to 68 conditions per place. [2025-02-06 09:39:22,282 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 13 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-02-06 09:39:22,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 81 transitions, 218 flow [2025-02-06 09:39:22,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:39:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:39:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions. [2025-02-06 09:39:22,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509389671361502 [2025-02-06 09:39:22,284 INFO L175 Difference]: Start difference. First operand has 111 places, 82 transitions, 188 flow. Second operand 4 states and 725 transitions. [2025-02-06 09:39:22,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 81 transitions, 218 flow [2025-02-06 09:39:22,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 81 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:22,285 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 191 flow [2025-02-06 09:39:22,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2025-02-06 09:39:22,286 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -23 predicate places. [2025-02-06 09:39:22,286 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 191 flow [2025-02-06 09:39:22,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:22,287 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:22,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:39:22,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:39:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash -412621298, now seen corresponding path program 1 times [2025-02-06 09:39:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525543694] [2025-02-06 09:39:22,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:22,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 09:39:22,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 09:39:22,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:22,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:22,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:39:22,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 09:39:22,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 09:39:22,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:22,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:22,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:39:22,323 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-06 09:39:22,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-06 09:39:22,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-06 09:39:22,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:39:22,324 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:39:22,324 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:39:22,324 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 09:39:22,359 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:22,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 249 transitions, 578 flow [2025-02-06 09:39:22,387 INFO L124 PetriNetUnfolderBase]: 26/406 cut-off events. [2025-02-06 09:39:22,387 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 09:39:22,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 406 events. 26/406 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1058 event pairs, 0 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 438. Up to 12 conditions per place. [2025-02-06 09:39:22,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 249 transitions, 578 flow [2025-02-06 09:39:22,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 116 transitions, 275 flow [2025-02-06 09:39:22,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:22,390 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:22,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 09:39:22,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:22,391 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:22,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:22,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:22,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:22,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 09:39:22,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash -477491918, now seen corresponding path program 1 times [2025-02-06 09:39:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:22,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735022003] [2025-02-06 09:39:22,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:22,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:22,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:22,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:22,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:22,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735022003] [2025-02-06 09:39:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735022003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:22,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:22,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824949259] [2025-02-06 09:39:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:22,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:22,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:22,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:22,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 249 [2025-02-06 09:39:22,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:22,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 249 [2025-02-06 09:39:22,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:22,618 INFO L124 PetriNetUnfolderBase]: 813/2126 cut-off events. [2025-02-06 09:39:22,618 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-02-06 09:39:22,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3612 conditions, 2126 events. 813/2126 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 13776 event pairs, 806 based on Foata normal form. 1/2038 useless extension candidates. Maximal degree in co-relation 1830. Up to 1191 conditions per place. [2025-02-06 09:39:22,632 INFO L140 encePairwiseOnDemand]: 244/249 looper letters, 21 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2025-02-06 09:39:22,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 113 transitions, 315 flow [2025-02-06 09:39:22,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-02-06 09:39:22,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8380187416331994 [2025-02-06 09:39:22,634 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 275 flow. Second operand 3 states and 626 transitions. [2025-02-06 09:39:22,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 113 transitions, 315 flow [2025-02-06 09:39:22,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 113 transitions, 302 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:22,636 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 258 flow [2025-02-06 09:39:22,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2025-02-06 09:39:22,637 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2025-02-06 09:39:22,637 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 258 flow [2025-02-06 09:39:22,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:22,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:22,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:39:22,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 09:39:22,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash -29147870, now seen corresponding path program 1 times [2025-02-06 09:39:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:22,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481644183] [2025-02-06 09:39:22,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:22,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:39:22,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:39:22,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:22,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:22,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481644183] [2025-02-06 09:39:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481644183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:22,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940952252] [2025-02-06 09:39:22,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:22,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:22,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:22,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:22,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 249 [2025-02-06 09:39:22,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:22,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 249 [2025-02-06 09:39:22,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:22,832 INFO L124 PetriNetUnfolderBase]: 621/1740 cut-off events. [2025-02-06 09:39:22,832 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-02-06 09:39:22,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1740 events. 621/1740 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10806 event pairs, 614 based on Foata normal form. 63/1735 useless extension candidates. Maximal degree in co-relation 2878. Up to 935 conditions per place. [2025-02-06 09:39:22,840 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 19 selfloop transitions, 1 changer transitions 18/107 dead transitions. [2025-02-06 09:39:22,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 107 transitions, 292 flow [2025-02-06 09:39:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2025-02-06 09:39:22,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7911646586345381 [2025-02-06 09:39:22,842 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 258 flow. Second operand 3 states and 591 transitions. [2025-02-06 09:39:22,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 107 transitions, 292 flow [2025-02-06 09:39:22,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 107 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:22,843 INFO L231 Difference]: Finished difference. Result has 120 places, 89 transitions, 208 flow [2025-02-06 09:39:22,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=120, PETRI_TRANSITIONS=89} [2025-02-06 09:39:22,844 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -6 predicate places. [2025-02-06 09:39:22,844 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 89 transitions, 208 flow [2025-02-06 09:39:22,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:22,844 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:22,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:39:22,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 09:39:22,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash 465867679, now seen corresponding path program 1 times [2025-02-06 09:39:22,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:22,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598997220] [2025-02-06 09:39:22,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:22,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 09:39:22,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 09:39:22,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:22,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:22,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:22,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598997220] [2025-02-06 09:39:22,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598997220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:22,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:22,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:39:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160041908] [2025-02-06 09:39:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:22,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:39:22,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:22,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:39:22,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:39:22,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 249 [2025-02-06 09:39:22,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 89 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:22,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 249 [2025-02-06 09:39:22,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:22,989 INFO L124 PetriNetUnfolderBase]: 98/431 cut-off events. [2025-02-06 09:39:22,989 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-02-06 09:39:22,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 431 events. 98/431 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1759 event pairs, 98 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 672. Up to 164 conditions per place. [2025-02-06 09:39:22,993 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 15 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2025-02-06 09:39:22,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 242 flow [2025-02-06 09:39:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:39:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:39:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 847 transitions. [2025-02-06 09:39:22,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8504016064257028 [2025-02-06 09:39:22,995 INFO L175 Difference]: Start difference. First operand has 120 places, 89 transitions, 208 flow. Second operand 4 states and 847 transitions. [2025-02-06 09:39:22,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 88 transitions, 242 flow [2025-02-06 09:39:22,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 88 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:22,996 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 211 flow [2025-02-06 09:39:22,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2025-02-06 09:39:22,997 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -23 predicate places. [2025-02-06 09:39:22,998 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 211 flow [2025-02-06 09:39:22,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:22,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:22,998 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:39:22,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 09:39:23,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:23,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1859038668, now seen corresponding path program 1 times [2025-02-06 09:39:23,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:23,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873831695] [2025-02-06 09:39:23,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:23,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 09:39:23,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 09:39:23,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:23,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:23,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:39:23,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 09:39:23,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 09:39:23,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:23,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:23,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:39:23,027 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-02-06 09:39:23,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-02-06 09:39:23,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:39:23,028 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:39:23,029 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:39:23,029 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-02-06 09:39:23,071 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:23,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 285 transitions, 678 flow [2025-02-06 09:39:23,101 INFO L124 PetriNetUnfolderBase]: 30/469 cut-off events. [2025-02-06 09:39:23,101 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-06 09:39:23,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 469 events. 30/469 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1224 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 510. Up to 14 conditions per place. [2025-02-06 09:39:23,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 285 transitions, 678 flow [2025-02-06 09:39:23,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 123 transitions, 303 flow [2025-02-06 09:39:23,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:23,105 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:23,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 09:39:23,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:23,106 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:23,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:23,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:23,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:23,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:39:23,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:23,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1188135278, now seen corresponding path program 1 times [2025-02-06 09:39:23,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:23,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405443193] [2025-02-06 09:39:23,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:23,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:23,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:23,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:23,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:23,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:23,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:23,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405443193] [2025-02-06 09:39:23,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405443193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:23,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:23,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033520260] [2025-02-06 09:39:23,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:23,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:23,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:23,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:23,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 285 [2025-02-06 09:39:23,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 123 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:23,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:23,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 285 [2025-02-06 09:39:23,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:23,514 INFO L124 PetriNetUnfolderBase]: 1998/4488 cut-off events. [2025-02-06 09:39:23,514 INFO L125 PetriNetUnfolderBase]: For 1165/1165 co-relation queries the response was YES. [2025-02-06 09:39:23,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7895 conditions, 4488 events. 1998/4488 cut-off events. For 1165/1165 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 31975 event pairs, 1990 based on Foata normal form. 1/4372 useless extension candidates. Maximal degree in co-relation 4009. Up to 2759 conditions per place. [2025-02-06 09:39:23,549 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 23 selfloop transitions, 2 changer transitions 1/120 dead transitions. [2025-02-06 09:39:23,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 120 transitions, 347 flow [2025-02-06 09:39:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-02-06 09:39:23,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8362573099415205 [2025-02-06 09:39:23,551 INFO L175 Difference]: Start difference. First operand has 135 places, 123 transitions, 303 flow. Second operand 3 states and 715 transitions. [2025-02-06 09:39:23,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 120 transitions, 347 flow [2025-02-06 09:39:23,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 120 transitions, 326 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:23,554 INFO L231 Difference]: Finished difference. Result has 135 places, 119 transitions, 278 flow [2025-02-06 09:39:23,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=135, PETRI_TRANSITIONS=119} [2025-02-06 09:39:23,554 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places. [2025-02-06 09:39:23,554 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 119 transitions, 278 flow [2025-02-06 09:39:23,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:23,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:23,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:23,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:39:23,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:39:23,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:23,556 INFO L85 PathProgramCache]: Analyzing trace with hash -911400641, now seen corresponding path program 1 times [2025-02-06 09:39:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:23,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228623551] [2025-02-06 09:39:23,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:23,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:23,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:39:23,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:39:23,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:23,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:23,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228623551] [2025-02-06 09:39:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228623551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078512944] [2025-02-06 09:39:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:23,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:23,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:23,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:23,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 285 [2025-02-06 09:39:23,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 119 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:23,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:23,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 285 [2025-02-06 09:39:23,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:23,934 INFO L124 PetriNetUnfolderBase]: 1550/3654 cut-off events. [2025-02-06 09:39:23,935 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-02-06 09:39:23,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 3654 events. 1550/3654 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 24996 event pairs, 1542 based on Foata normal form. 127/3688 useless extension candidates. Maximal degree in co-relation 6264. Up to 2183 conditions per place. [2025-02-06 09:39:23,954 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 21 selfloop transitions, 1 changer transitions 18/114 dead transitions. [2025-02-06 09:39:23,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 114 transitions, 316 flow [2025-02-06 09:39:23,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2025-02-06 09:39:23,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7883040935672515 [2025-02-06 09:39:23,956 INFO L175 Difference]: Start difference. First operand has 135 places, 119 transitions, 278 flow. Second operand 3 states and 674 transitions. [2025-02-06 09:39:23,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 114 transitions, 316 flow [2025-02-06 09:39:23,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 114 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:23,958 INFO L231 Difference]: Finished difference. Result has 129 places, 96 transitions, 228 flow [2025-02-06 09:39:23,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=129, PETRI_TRANSITIONS=96} [2025-02-06 09:39:23,958 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, -6 predicate places. [2025-02-06 09:39:23,958 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 96 transitions, 228 flow [2025-02-06 09:39:23,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:23,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:23,959 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:23,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:39:23,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:39:23,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash -74987255, now seen corresponding path program 1 times [2025-02-06 09:39:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469209562] [2025-02-06 09:39:23,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:23,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 09:39:23,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 09:39:23,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:23,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:24,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:24,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469209562] [2025-02-06 09:39:24,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469209562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:24,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:24,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:39:24,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046489086] [2025-02-06 09:39:24,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:24,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:39:24,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:24,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:39:24,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:39:24,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 285 [2025-02-06 09:39:24,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 96 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:24,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:24,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 285 [2025-02-06 09:39:24,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:24,118 INFO L124 PetriNetUnfolderBase]: 258/803 cut-off events. [2025-02-06 09:39:24,118 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-02-06 09:39:24,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 803 events. 258/803 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4090 event pairs, 258 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 1364. Up to 388 conditions per place. [2025-02-06 09:39:24,123 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 17 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-02-06 09:39:24,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 95 transitions, 266 flow [2025-02-06 09:39:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:39:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:39:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 969 transitions. [2025-02-06 09:39:24,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-02-06 09:39:24,125 INFO L175 Difference]: Start difference. First operand has 129 places, 96 transitions, 228 flow. Second operand 4 states and 969 transitions. [2025-02-06 09:39:24,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 95 transitions, 266 flow [2025-02-06 09:39:24,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 95 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:24,127 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 231 flow [2025-02-06 09:39:24,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2025-02-06 09:39:24,127 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, -23 predicate places. [2025-02-06 09:39:24,127 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 231 flow [2025-02-06 09:39:24,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:24,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:24,128 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:24,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:39:24,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:39:24,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1539814323, now seen corresponding path program 1 times [2025-02-06 09:39:24,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:24,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83576192] [2025-02-06 09:39:24,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:24,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:24,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 09:39:24,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 09:39:24,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:24,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:24,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:39:24,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 09:39:24,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 09:39:24,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:24,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:24,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:39:24,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:39:24,164 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-02-06 09:39:24,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-02-06 09:39:24,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:39:24,166 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:39:24,166 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:39:24,167 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-02-06 09:39:24,215 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:24,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 321 transitions, 782 flow [2025-02-06 09:39:24,245 INFO L124 PetriNetUnfolderBase]: 34/532 cut-off events. [2025-02-06 09:39:24,245 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 09:39:24,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 532 events. 34/532 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1452 event pairs, 0 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 583. Up to 16 conditions per place. [2025-02-06 09:39:24,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 321 transitions, 782 flow [2025-02-06 09:39:24,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 130 transitions, 333 flow [2025-02-06 09:39:24,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:24,249 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:24,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-06 09:39:24,249 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:24,249 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:24,250 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:24,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:24,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:24,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-06 09:39:24,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1628270450, now seen corresponding path program 1 times [2025-02-06 09:39:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163424717] [2025-02-06 09:39:24,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:24,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:24,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:24,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:24,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163424717] [2025-02-06 09:39:24,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163424717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:24,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:24,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:24,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478847192] [2025-02-06 09:39:24,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:24,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:24,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:24,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:24,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:24,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 321 [2025-02-06 09:39:24,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 130 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:24,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:24,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 321 [2025-02-06 09:39:24,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:25,147 INFO L124 PetriNetUnfolderBase]: 4751/9570 cut-off events. [2025-02-06 09:39:25,148 INFO L125 PetriNetUnfolderBase]: For 3091/3091 co-relation queries the response was YES. [2025-02-06 09:39:25,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17266 conditions, 9570 events. 4751/9570 cut-off events. For 3091/3091 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 72697 event pairs, 4742 based on Foata normal form. 1/9422 useless extension candidates. Maximal degree in co-relation 8748. Up to 6279 conditions per place. [2025-02-06 09:39:25,202 INFO L140 encePairwiseOnDemand]: 316/321 looper letters, 25 selfloop transitions, 2 changer transitions 1/127 dead transitions. [2025-02-06 09:39:25,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 127 transitions, 381 flow [2025-02-06 09:39:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2025-02-06 09:39:25,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8348909657320872 [2025-02-06 09:39:25,203 INFO L175 Difference]: Start difference. First operand has 144 places, 130 transitions, 333 flow. Second operand 3 states and 804 transitions. [2025-02-06 09:39:25,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 127 transitions, 381 flow [2025-02-06 09:39:25,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 127 transitions, 350 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:25,206 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 298 flow [2025-02-06 09:39:25,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2025-02-06 09:39:25,206 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2025-02-06 09:39:25,206 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 298 flow [2025-02-06 09:39:25,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:25,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:25,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 09:39:25,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-06 09:39:25,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash 445833600, now seen corresponding path program 1 times [2025-02-06 09:39:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:25,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108142765] [2025-02-06 09:39:25,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:25,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:39:25,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:39:25,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:25,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:25,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108142765] [2025-02-06 09:39:25,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108142765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:25,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:25,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112841348] [2025-02-06 09:39:25,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:25,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:25,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:25,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:25,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 321 [2025-02-06 09:39:25,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:25,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:25,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 321 [2025-02-06 09:39:25,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:25,930 INFO L124 PetriNetUnfolderBase]: 3727/7776 cut-off events. [2025-02-06 09:39:25,930 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-02-06 09:39:25,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13678 conditions, 7776 events. 3727/7776 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 57371 event pairs, 3718 based on Foata normal form. 255/7909 useless extension candidates. Maximal degree in co-relation 13650. Up to 4999 conditions per place. [2025-02-06 09:39:25,973 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 23 selfloop transitions, 1 changer transitions 18/121 dead transitions. [2025-02-06 09:39:25,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 121 transitions, 340 flow [2025-02-06 09:39:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2025-02-06 09:39:25,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7860851505711319 [2025-02-06 09:39:25,975 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 298 flow. Second operand 3 states and 757 transitions. [2025-02-06 09:39:25,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 121 transitions, 340 flow [2025-02-06 09:39:25,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 121 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:25,977 INFO L231 Difference]: Finished difference. Result has 138 places, 103 transitions, 248 flow [2025-02-06 09:39:25,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=138, PETRI_TRANSITIONS=103} [2025-02-06 09:39:25,977 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -6 predicate places. [2025-02-06 09:39:25,977 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 103 transitions, 248 flow [2025-02-06 09:39:25,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:25,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:25,978 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:25,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:39:25,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-06 09:39:25,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash -551490632, now seen corresponding path program 1 times [2025-02-06 09:39:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27885646] [2025-02-06 09:39:25,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:25,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 09:39:25,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 09:39:25,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:25,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:26,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:26,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27885646] [2025-02-06 09:39:26,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27885646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:26,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:26,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:39:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972948755] [2025-02-06 09:39:26,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:26,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:39:26,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:26,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:39:26,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:39:26,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 321 [2025-02-06 09:39:26,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 103 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:26,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:26,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 321 [2025-02-06 09:39:26,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:26,304 INFO L124 PetriNetUnfolderBase]: 642/1591 cut-off events. [2025-02-06 09:39:26,304 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2025-02-06 09:39:26,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 1591 events. 642/1591 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9405 event pairs, 642 based on Foata normal form. 0/1492 useless extension candidates. Maximal degree in co-relation 2856. Up to 900 conditions per place. [2025-02-06 09:39:26,318 INFO L140 encePairwiseOnDemand]: 317/321 looper letters, 19 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-02-06 09:39:26,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 102 transitions, 290 flow [2025-02-06 09:39:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:39:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:39:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1091 transitions. [2025-02-06 09:39:26,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8496884735202492 [2025-02-06 09:39:26,320 INFO L175 Difference]: Start difference. First operand has 138 places, 103 transitions, 248 flow. Second operand 4 states and 1091 transitions. [2025-02-06 09:39:26,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 102 transitions, 290 flow [2025-02-06 09:39:26,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 102 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:26,323 INFO L231 Difference]: Finished difference. Result has 121 places, 102 transitions, 251 flow [2025-02-06 09:39:26,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=121, PETRI_TRANSITIONS=102} [2025-02-06 09:39:26,324 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -23 predicate places. [2025-02-06 09:39:26,324 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 102 transitions, 251 flow [2025-02-06 09:39:26,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:26,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:26,325 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:26,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 09:39:26,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-06 09:39:26,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash 427491587, now seen corresponding path program 1 times [2025-02-06 09:39:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363977981] [2025-02-06 09:39:26,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:26,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 09:39:26,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 09:39:26,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:26,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:26,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:39:26,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 09:39:26,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 09:39:26,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:26,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:26,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:39:26,379 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-02-06 09:39:26,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-02-06 09:39:26,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-02-06 09:39:26,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-02-06 09:39:26,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-02-06 09:39:26,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-02-06 09:39:26,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-02-06 09:39:26,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 09:39:26,380 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:39:26,381 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:39:26,381 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-02-06 09:39:26,438 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:26,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 364 places, 357 transitions, 890 flow [2025-02-06 09:39:26,480 INFO L124 PetriNetUnfolderBase]: 38/595 cut-off events. [2025-02-06 09:39:26,480 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-02-06 09:39:26,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 595 events. 38/595 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1587 event pairs, 0 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 657. Up to 18 conditions per place. [2025-02-06 09:39:26,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 357 transitions, 890 flow [2025-02-06 09:39:26,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 137 transitions, 365 flow [2025-02-06 09:39:26,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:26,484 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:26,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 09:39:26,485 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:26,486 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:26,486 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:26,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:26,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:26,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:39:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash -618209326, now seen corresponding path program 1 times [2025-02-06 09:39:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121455162] [2025-02-06 09:39:26,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:26,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:26,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:26,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:26,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:26,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:26,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121455162] [2025-02-06 09:39:26,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121455162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:26,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:26,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767704897] [2025-02-06 09:39:26,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:26,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:26,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:26,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:26,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 357 [2025-02-06 09:39:26,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:26,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:26,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 357 [2025-02-06 09:39:26,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:28,532 INFO L124 PetriNetUnfolderBase]: 11024/20476 cut-off events. [2025-02-06 09:39:28,533 INFO L125 PetriNetUnfolderBase]: For 7962/7962 co-relation queries the response was YES. [2025-02-06 09:39:28,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37645 conditions, 20476 events. 11024/20476 cut-off events. For 7962/7962 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 164760 event pairs, 11014 based on Foata normal form. 1/20292 useless extension candidates. Maximal degree in co-relation 18991. Up to 14087 conditions per place. [2025-02-06 09:39:28,894 INFO L140 encePairwiseOnDemand]: 352/357 looper letters, 27 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-02-06 09:39:28,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 134 transitions, 417 flow [2025-02-06 09:39:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-02-06 09:39:28,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8338001867413632 [2025-02-06 09:39:28,902 INFO L175 Difference]: Start difference. First operand has 153 places, 137 transitions, 365 flow. Second operand 3 states and 893 transitions. [2025-02-06 09:39:28,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 134 transitions, 417 flow [2025-02-06 09:39:28,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 134 transitions, 374 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:28,906 INFO L231 Difference]: Finished difference. Result has 153 places, 133 transitions, 318 flow [2025-02-06 09:39:28,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=153, PETRI_TRANSITIONS=133} [2025-02-06 09:39:28,906 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 0 predicate places. [2025-02-06 09:39:28,907 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 133 transitions, 318 flow [2025-02-06 09:39:28,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:28,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:28,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:28,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 09:39:28,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:39:28,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:28,907 INFO L85 PathProgramCache]: Analyzing trace with hash -252412443, now seen corresponding path program 1 times [2025-02-06 09:39:28,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:28,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047526219] [2025-02-06 09:39:28,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:28,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:28,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:39:28,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:39:28,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:28,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:28,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:28,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047526219] [2025-02-06 09:39:28,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047526219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:28,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:28,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:28,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155785694] [2025-02-06 09:39:28,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:28,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:28,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:28,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:28,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:28,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 357 [2025-02-06 09:39:28,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 133 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:28,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:28,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 357 [2025-02-06 09:39:28,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:30,364 INFO L124 PetriNetUnfolderBase]: 8720/16634 cut-off events. [2025-02-06 09:39:30,365 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2025-02-06 09:39:30,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29705 conditions, 16634 events. 8720/16634 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 129848 event pairs, 8710 based on Foata normal form. 511/16990 useless extension candidates. Maximal degree in co-relation 29676. Up to 11271 conditions per place. [2025-02-06 09:39:30,434 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 25 selfloop transitions, 1 changer transitions 18/128 dead transitions. [2025-02-06 09:39:30,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 128 transitions, 364 flow [2025-02-06 09:39:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2025-02-06 09:39:30,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-02-06 09:39:30,436 INFO L175 Difference]: Start difference. First operand has 153 places, 133 transitions, 318 flow. Second operand 3 states and 840 transitions. [2025-02-06 09:39:30,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 128 transitions, 364 flow [2025-02-06 09:39:30,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 128 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:30,438 INFO L231 Difference]: Finished difference. Result has 147 places, 110 transitions, 268 flow [2025-02-06 09:39:30,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=147, PETRI_TRANSITIONS=110} [2025-02-06 09:39:30,438 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -6 predicate places. [2025-02-06 09:39:30,438 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 110 transitions, 268 flow [2025-02-06 09:39:30,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:30,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:30,439 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:30,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 09:39:30,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:39:30,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:30,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1025143276, now seen corresponding path program 1 times [2025-02-06 09:39:30,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:30,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103825209] [2025-02-06 09:39:30,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:30,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 09:39:30,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 09:39:30,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:30,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:30,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103825209] [2025-02-06 09:39:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103825209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:30,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:30,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:39:30,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810046704] [2025-02-06 09:39:30,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:30,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:39:30,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:30,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:39:30,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:39:30,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 357 [2025-02-06 09:39:30,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 110 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:30,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:30,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 357 [2025-02-06 09:39:30,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:30,749 INFO L124 PetriNetUnfolderBase]: 1538/3275 cut-off events. [2025-02-06 09:39:30,749 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2025-02-06 09:39:30,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 3275 events. 1538/3275 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 21672 event pairs, 1538 based on Foata normal form. 0/3112 useless extension candidates. Maximal degree in co-relation 6076. Up to 2052 conditions per place. [2025-02-06 09:39:30,772 INFO L140 encePairwiseOnDemand]: 353/357 looper letters, 21 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-02-06 09:39:30,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 109 transitions, 314 flow [2025-02-06 09:39:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:39:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:39:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1213 transitions. [2025-02-06 09:39:30,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8494397759103641 [2025-02-06 09:39:30,774 INFO L175 Difference]: Start difference. First operand has 147 places, 110 transitions, 268 flow. Second operand 4 states and 1213 transitions. [2025-02-06 09:39:30,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 109 transitions, 314 flow [2025-02-06 09:39:30,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 109 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:30,777 INFO L231 Difference]: Finished difference. Result has 130 places, 109 transitions, 271 flow [2025-02-06 09:39:30,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=130, PETRI_TRANSITIONS=109} [2025-02-06 09:39:30,779 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -23 predicate places. [2025-02-06 09:39:30,779 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 109 transitions, 271 flow [2025-02-06 09:39:30,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:30,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:30,779 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:30,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 09:39:30,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:39:30,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash 401665788, now seen corresponding path program 1 times [2025-02-06 09:39:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82117387] [2025-02-06 09:39:30,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:30,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:30,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 09:39:30,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 09:39:30,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:30,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:30,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:39:30,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 09:39:30,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 09:39:30,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:30,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:30,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:39:30,812 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:39:30,812 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-06 09:39:30,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-06 09:39:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-06 09:39:30,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 09:39:30,814 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:39:30,814 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:39:30,814 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-02-06 09:39:30,859 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:30,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 393 transitions, 1002 flow [2025-02-06 09:39:30,891 INFO L124 PetriNetUnfolderBase]: 42/658 cut-off events. [2025-02-06 09:39:30,891 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-02-06 09:39:30,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 658 events. 42/658 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1798 event pairs, 0 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 732. Up to 20 conditions per place. [2025-02-06 09:39:30,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 393 transitions, 1002 flow [2025-02-06 09:39:30,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 144 transitions, 399 flow [2025-02-06 09:39:30,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:30,893 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:30,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 09:39:30,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:30,894 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:30,895 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:30,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:30,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:30,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 09:39:30,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:30,895 INFO L85 PathProgramCache]: Analyzing trace with hash 662359986, now seen corresponding path program 1 times [2025-02-06 09:39:30,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:30,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703324602] [2025-02-06 09:39:30,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:30,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:30,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:30,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:30,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:30,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:30,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:30,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703324602] [2025-02-06 09:39:30,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703324602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:30,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010384797] [2025-02-06 09:39:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:30,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:30,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:30,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:30,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 393 [2025-02-06 09:39:30,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 144 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:30,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:30,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 393 [2025-02-06 09:39:30,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:35,645 INFO L124 PetriNetUnfolderBase]: 25105/43798 cut-off events. [2025-02-06 09:39:35,645 INFO L125 PetriNetUnfolderBase]: For 20002/20002 co-relation queries the response was YES. [2025-02-06 09:39:35,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81704 conditions, 43798 events. 25105/43798 cut-off events. For 20002/20002 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 367421 event pairs, 25094 based on Foata normal form. 1/43574 useless extension candidates. Maximal degree in co-relation 41010. Up to 31239 conditions per place. [2025-02-06 09:39:35,964 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 29 selfloop transitions, 2 changer transitions 1/141 dead transitions. [2025-02-06 09:39:35,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 141 transitions, 455 flow [2025-02-06 09:39:35,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2025-02-06 09:39:35,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8329092451229856 [2025-02-06 09:39:35,967 INFO L175 Difference]: Start difference. First operand has 162 places, 144 transitions, 399 flow. Second operand 3 states and 982 transitions. [2025-02-06 09:39:35,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 141 transitions, 455 flow [2025-02-06 09:39:35,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 141 transitions, 398 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:35,972 INFO L231 Difference]: Finished difference. Result has 162 places, 140 transitions, 338 flow [2025-02-06 09:39:35,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=162, PETRI_TRANSITIONS=140} [2025-02-06 09:39:35,973 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 0 predicate places. [2025-02-06 09:39:35,973 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 140 transitions, 338 flow [2025-02-06 09:39:35,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:35,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:35,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:35,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 09:39:35,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 09:39:35,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1288828526, now seen corresponding path program 1 times [2025-02-06 09:39:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:35,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992718560] [2025-02-06 09:39:35,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:35,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:39:35,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:39:35,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:35,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:35,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:35,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992718560] [2025-02-06 09:39:35,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992718560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:35,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:35,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:35,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051457231] [2025-02-06 09:39:35,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:35,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:35,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:35,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:36,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 393 [2025-02-06 09:39:36,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 140 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:36,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:36,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 393 [2025-02-06 09:39:36,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:39,532 INFO L124 PetriNetUnfolderBase]: 19985/35604 cut-off events. [2025-02-06 09:39:39,532 INFO L125 PetriNetUnfolderBase]: For 1568/1568 co-relation queries the response was YES. [2025-02-06 09:39:39,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64292 conditions, 35604 events. 19985/35604 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 290338 event pairs, 19974 based on Foata normal form. 1023/36435 useless extension candidates. Maximal degree in co-relation 64262. Up to 25095 conditions per place. [2025-02-06 09:39:39,715 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 27 selfloop transitions, 1 changer transitions 18/135 dead transitions. [2025-02-06 09:39:39,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 135 transitions, 388 flow [2025-02-06 09:39:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-02-06 09:39:39,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7828668363019508 [2025-02-06 09:39:39,716 INFO L175 Difference]: Start difference. First operand has 162 places, 140 transitions, 338 flow. Second operand 3 states and 923 transitions. [2025-02-06 09:39:39,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 135 transitions, 388 flow [2025-02-06 09:39:39,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 135 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:39,718 INFO L231 Difference]: Finished difference. Result has 156 places, 117 transitions, 288 flow [2025-02-06 09:39:39,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=156, PETRI_TRANSITIONS=117} [2025-02-06 09:39:39,719 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -6 predicate places. [2025-02-06 09:39:39,719 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 117 transitions, 288 flow [2025-02-06 09:39:39,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:39,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:39,720 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:39,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 09:39:39,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 09:39:39,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1605738981, now seen corresponding path program 1 times [2025-02-06 09:39:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:39,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725346259] [2025-02-06 09:39:39,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:39,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 09:39:39,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 09:39:39,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:39,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:39,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:39,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725346259] [2025-02-06 09:39:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725346259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:39,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:39:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033548134] [2025-02-06 09:39:39,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:39,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:39:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:39,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:39:39,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:39:39,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 393 [2025-02-06 09:39:39,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 117 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:39,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:39,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 393 [2025-02-06 09:39:39,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:40,436 INFO L124 PetriNetUnfolderBase]: 3586/6879 cut-off events. [2025-02-06 09:39:40,436 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-02-06 09:39:40,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13040 conditions, 6879 events. 3586/6879 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 49078 event pairs, 3586 based on Foata normal form. 0/6623 useless extension candidates. Maximal degree in co-relation 13008. Up to 4612 conditions per place. [2025-02-06 09:39:40,488 INFO L140 encePairwiseOnDemand]: 389/393 looper letters, 23 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-02-06 09:39:40,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 116 transitions, 338 flow [2025-02-06 09:39:40,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:39:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:39:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1335 transitions. [2025-02-06 09:39:40,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8492366412213741 [2025-02-06 09:39:40,490 INFO L175 Difference]: Start difference. First operand has 156 places, 117 transitions, 288 flow. Second operand 4 states and 1335 transitions. [2025-02-06 09:39:40,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 116 transitions, 338 flow [2025-02-06 09:39:40,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 116 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:40,492 INFO L231 Difference]: Finished difference. Result has 139 places, 116 transitions, 291 flow [2025-02-06 09:39:40,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=139, PETRI_TRANSITIONS=116} [2025-02-06 09:39:40,492 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -23 predicate places. [2025-02-06 09:39:40,493 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 116 transitions, 291 flow [2025-02-06 09:39:40,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:40,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:40,493 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:40,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 09:39:40,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 09:39:40,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 774776542, now seen corresponding path program 1 times [2025-02-06 09:39:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838606318] [2025-02-06 09:39:40,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:40,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 09:39:40,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 09:39:40,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:40,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:40,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:39:40,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 09:39:40,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 09:39:40,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:40,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:39:40,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:39:40,523 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:39:40,523 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-06 09:39:40,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-02-06 09:39:40,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-02-06 09:39:40,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-02-06 09:39:40,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-02-06 09:39:40,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 09:39:40,524 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:39:40,525 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:39:40,525 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-02-06 09:39:40,581 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:39:40,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 438 places, 429 transitions, 1118 flow [2025-02-06 09:39:40,618 INFO L124 PetriNetUnfolderBase]: 46/721 cut-off events. [2025-02-06 09:39:40,618 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-02-06 09:39:40,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 721 events. 46/721 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1975 event pairs, 0 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 808. Up to 22 conditions per place. [2025-02-06 09:39:40,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 438 places, 429 transitions, 1118 flow [2025-02-06 09:39:40,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 151 transitions, 435 flow [2025-02-06 09:39:40,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:39:40,622 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;@2694577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:39:40,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-06 09:39:40,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:39:40,623 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 09:39:40,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:39:40,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:40,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:40,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-06 09:39:40,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:40,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1175011090, now seen corresponding path program 1 times [2025-02-06 09:39:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:40,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349126959] [2025-02-06 09:39:40,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:40,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:39:40,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:39:40,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:40,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:40,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:40,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349126959] [2025-02-06 09:39:40,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349126959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:40,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:40,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819294646] [2025-02-06 09:39:40,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:40,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:40,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:40,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:40,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:40,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 429 [2025-02-06 09:39:40,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 151 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:39:40,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:40,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 429 [2025-02-06 09:39:40,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand